Base | Representation |
---|---|
bin | 101000000001001000111… |
… | …1000001000100111010111 |
3 | 201110210110211202211120200 |
4 | 1100002101320020213113 |
5 | 1210103002410104201 |
6 | 15410400114431543 |
7 | 1105235156550051 |
oct | 120022170104727 |
9 | 21423424684520 |
10 | 5500005550551 |
11 | 18305a2826196 |
12 | 749b308925b3 |
13 | 30b857406595 |
14 | 1502b76128d1 |
15 | 98103a9e386 |
hex | 50091e089d7 |
5500005550551 has 12 divisors (see below), whose sum is σ = 7944520092912. Its totient is φ = 3666639152736.
The previous prime is 5500005550547. The next prime is 5500005550603. The reversal of 5500005550551 is 1550555000055.
It is a happy number.
5500005550551 is a `hidden beast` number, since 5 + 5 + 0 + 0 + 0 + 0 + 55 + 50 + 551 = 666.
It is not a de Polignac number, because 5500005550551 - 22 = 5500005550547 is a prime.
It is a super-2 number, since 2×55000055505512 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5500005550541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1458846 + ... + 3623291.
It is an arithmetic number, because the mean of its divisors is an integer number (662043341076).
Almost surely, 25500005550551 is an apocalyptic number.
5500005550551 is a deficient number, since it is larger than the sum of its proper divisors (2444514542361).
5500005550551 is a wasteful number, since it uses less digits than its factorization.
5500005550551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5202390 (or 5202387 counting only the distinct ones).
The product of its (nonzero) digits is 78125, while the sum is 36.
The spelling of 5500005550551 in words is "five trillion, five hundred billion, five million, five hundred fifty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •