Base | Representation |
---|---|
bin | 11001000010010111000000… |
… | …10101001010011001000111 |
3 | 21012221100211220121100101121 |
4 | 30201023200111022121013 |
5 | 24204022012014202403 |
6 | 313032402231134411 |
7 | 14411466136130554 |
oct | 1441134025123107 |
9 | 235840756540347 |
10 | 55056654444103 |
11 | 165a743a122a84 |
12 | 6212422214407 |
13 | 2494a880a1740 |
14 | d84a833a9a2b |
15 | 65723b0333bd |
hex | 3212e054a647 |
55056654444103 has 8 divisors (see below), whose sum is σ = 59689713132000. Its totient is φ = 50480443102368.
The previous prime is 55056654444083. The next prime is 55056654444109. The reversal of 55056654444103 is 30144445665055.
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 55056654444103 - 221 = 55056652346951 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 (55056654444109) 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, 14211834523 + ... + 14211838396.
It is an arithmetic number, because the mean of its divisors is an integer number (7461214141500).
Almost surely, 255056654444103 is an apocalyptic number.
55056654444103 is a deficient number, since it is larger than the sum of its proper divisors (4633058687897).
55056654444103 is a wasteful number, since it uses less digits than its factorization.
55056654444103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28423673081.
The product of its (nonzero) digits is 17280000, while the sum is 52.
The spelling of 55056654444103 in words is "fifty-five trillion, fifty-six billion, six hundred fifty-four million, four hundred forty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •