Base | Representation |
---|---|
bin | 11001000100010010110011… |
… | …00001000011010000111011 |
3 | 21020011201101110102201210202 |
4 | 30202021121201003100323 |
5 | 24211114113200110321 |
6 | 313123112541432415 |
7 | 14416341051034112 |
oct | 1442113141032073 |
9 | 236151343381722 |
10 | 55123112113211 |
11 | 1662264280545a |
12 | 622328a86b70b |
13 | 249b11967acbc |
14 | d87d89764c79 |
15 | 658d2a67470b |
hex | 32225984343b |
55123112113211 has 8 divisors (see below), whose sum is σ = 55660197863424. Its totient is φ = 54588614728680.
The previous prime is 55123112113109. The next prime is 55123112113241. The reversal of 55123112113211 is 11231121132155.
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 55123112113211 - 214 = 55123112096827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55123112113241) 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, 647048621 + ... + 647133806.
It is an arithmetic number, because the mean of its divisors is an integer number (6957524732928).
Almost surely, 255123112113211 is an apocalyptic number.
55123112113211 is a deficient number, since it is larger than the sum of its proper divisors (537085750213).
55123112113211 is a wasteful number, since it uses less digits than its factorization.
55123112113211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1294182841.
The product of its digits is 1800, while the sum is 29.
Adding to 55123112113211 its reverse (11231121132155), we get a palindrome (66354233245366).
The spelling of 55123112113211 in words is "fifty-five trillion, one hundred twenty-three billion, one hundred twelve million, one hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •