Base | Representation |
---|---|
bin | 1010111110000101010101… |
… | …10011110011101101100011 |
3 | 10011102011201100212110122201 |
4 | 11133002222303303231203 |
5 | 11130214211410322321 |
6 | 123150045442114031 |
7 | 5036600251051603 |
oct | 537025263635543 |
9 | 104364640773581 |
10 | 24123402042211 |
11 | 776074a61445a |
12 | 285733a64b917 |
13 | 105ca9a056054 |
14 | 5d5816682c03 |
15 | 2bc789804291 |
hex | 15f0aacf3b63 |
24123402042211 has 2 divisors, whose sum is σ = 24123402042212. Its totient is φ = 24123402042210.
The previous prime is 24123402042193. The next prime is 24123402042239. The reversal of 24123402042211 is 11224020432142.
It is an a-pointer prime, because the next prime (24123402042239) can be obtained adding 24123402042211 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-24123402042211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 24123402042211.
It is not a weakly prime, because it can be changed into another prime (24123402042511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12061701021105 + 12061701021106.
It is an arithmetic number, because the mean of its divisors is an integer number (12061701021106).
Almost surely, 224123402042211 is an apocalyptic number.
24123402042211 is a deficient number, since it is larger than the sum of its proper divisors (1).
24123402042211 is an equidigital number, since it uses as much as digits as its factorization.
24123402042211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 24123402042211 its reverse (11224020432142), we get a palindrome (35347422474353).
The spelling of 24123402042211 in words is "twenty-four trillion, one hundred twenty-three billion, four hundred two million, forty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •