Base | Representation |
---|---|
bin | 11001000100110110001100… |
… | …00000010000111100100111 |
3 | 21020020112102121021021121212 |
4 | 30202123012000100330213 |
5 | 24211422021144313411 |
6 | 313135534145302035 |
7 | 14420612641221665 |
oct | 1442330600207447 |
9 | 236215377237555 |
10 | 55142112104231 |
11 | 1662a702804979 |
12 | 6226ab193491b |
13 | 249cb56b14639 |
14 | d88c6ccd9c35 |
15 | 65958d70b68b |
hex | 3226c6010f27 |
55142112104231 has 2 divisors, whose sum is σ = 55142112104232. Its totient is φ = 55142112104230.
The previous prime is 55142112104221. The next prime is 55142112104243. The reversal of 55142112104231 is 13240121124155.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 55142112104231 - 222 = 55142107909927 is a prime.
It is a super-2 number, since 2×551421121042312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55142112104221) 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 as a sum of consecutive naturals, namely, 27571056052115 + 27571056052116.
It is an arithmetic number, because the mean of its divisors is an integer number (27571056052116).
Almost surely, 255142112104231 is an apocalyptic number.
55142112104231 is a deficient number, since it is larger than the sum of its proper divisors (1).
55142112104231 is an equidigital number, since it uses as much as digits as its factorization.
55142112104231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9600, while the sum is 32.
Adding to 55142112104231 its reverse (13240121124155), we get a palindrome (68382233228386).
The spelling of 55142112104231 in words is "fifty-five trillion, one hundred forty-two billion, one hundred twelve million, one hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •