Base | Representation |
---|---|

bin | 1010010101101110… |

… | …11001101110000111 |

3 | 112022212012020201011 |

4 | 11022313121232013 |

5 | 42332024121201 |

6 | 2314453143051 |

7 | 254362521511 |

oct | 51267315607 |

9 | 15285166634 |

10 | 5551004551 |

11 | 2399440974 |

12 | 10ab02aa87 |

13 | 6a60613a1 |

14 | 3a9332bb1 |

15 | 2274e7151 |

hex | 14add9b87 |

5551004551 has 8 divisors (see below), whose sum is σ = 5573492480. Its totient is φ = 5528557368.

The previous prime is 5551004549. The next prime is 5551004561. The reversal of 5551004551 is 1554001555.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 5551004551 - 2^{1} = 5551004549 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5551004561) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 279220 + ... + 298438.

It is an arithmetic number, because the mean of its divisors is an integer number (696686560).

Almost surely, 2^{5551004551} is an apocalyptic number.

5551004551 is a deficient number, since it is larger than the sum of its proper divisors (22487929).

5551004551 is a wasteful number, since it uses less digits than its factorization.

5551004551 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 20373.

The product of its (nonzero) digits is 12500, while the sum is 31.

The square root of 5551004551 is about 74505.0639285680. The cubic root of 5551004551 is about 1770.6138667889.

It can be divided in two parts, 5551004 and 551, that added together give a palindrome (5551555).

The spelling of 5551004551 in words is "five billion, five hundred fifty-one million, four thousand, five hundred fifty-one".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •