Base | Representation |
---|---|
bin | 11001001111011100000000… |
… | …00000110010010100001111 |
3 | 21021112022201021110120122102 |
4 | 30213232000000302110033 |
5 | 24233402302033242301 |
6 | 314015035313305315 |
7 | 14456114446612640 |
oct | 1447560000622417 |
9 | 237468637416572 |
10 | 55506010055951 |
11 | 1675aa6a702034 |
12 | 628552a56523b |
13 | 24c826ab11c20 |
14 | d9c71047d6c7 |
15 | 663c8a936b6b |
hex | 327b8003250f |
55506010055951 has 8 divisors (see below), whose sum is σ = 68315089299744. Its totient is φ = 43916843121120.
The previous prime is 55506010055939. The next prime is 55506010056017. The reversal of 55506010055951 is 15955001060555.
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 55506010055951 - 210 = 55506010054927 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 55506010055896 and 55506010055905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55506010055351) 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, 304978077140 + ... + 304978077321.
It is an arithmetic number, because the mean of its divisors is an integer number (8539386162468).
Almost surely, 255506010055951 is an apocalyptic number.
55506010055951 is a deficient number, since it is larger than the sum of its proper divisors (12809079243793).
55506010055951 is a wasteful number, since it uses less digits than its factorization.
55506010055951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 609956154481.
The product of its (nonzero) digits is 843750, while the sum is 47.
The spelling of 55506010055951 in words is "fifty-five trillion, five hundred six billion, ten million, fifty-five thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •