Base | Representation |
---|---|
bin | 11001000100010001110001… |
… | …10011101110000000000001 |
3 | 21020011122222012212010011101 |
4 | 30202020320303232000001 |
5 | 24211112002204434341 |
6 | 313122542300014401 |
7 | 14416321335510565 |
oct | 1442107063560001 |
9 | 236148865763141 |
10 | 55122563358721 |
11 | 16622390a79051 |
12 | 6223156b31401 |
13 | 249b05ca856c1 |
14 | d87d3691b6a5 |
15 | 658ce73ca831 |
hex | 322238cee001 |
55122563358721 has 4 divisors (see below), whose sum is σ = 55175011088944. Its totient is φ = 55070115628500.
The previous prime is 55122563358697. The next prime is 55122563358757. The reversal of 55122563358721 is 12785336522155.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 55122563358721 - 27 = 55122563358593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55122563358221) 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 3 ways as a sum of consecutive naturals, for example, 26223863535 + ... + 26223865636.
It is an arithmetic number, because the mean of its divisors is an integer number (13793752772236).
Almost surely, 255122563358721 is an apocalyptic number.
It is an amenable number.
55122563358721 is a deficient number, since it is larger than the sum of its proper divisors (52447730223).
55122563358721 is a wasteful number, since it uses less digits than its factorization.
55122563358721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52447730222.
The product of its digits is 15120000, while the sum is 55.
The spelling of 55122563358721 in words is "fifty-five trillion, one hundred twenty-two billion, five hundred sixty-three million, three hundred fifty-eight thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •