Base | Representation |
---|---|
bin | 1010100000111000011001… |
… | …10110000001010101111001 |
3 | 10000212020211020220012001012 |
4 | 11100130030312001111321 |
5 | 11012244302224122413 |
6 | 121101105334003305 |
7 | 4604236521141365 |
oct | 520341466012571 |
9 | 100766736805035 |
10 | 23120024442233 |
11 | 7404169072724 |
12 | 27149954a6535 |
13 | cb92940a8354 |
14 | 59d02d8202a5 |
15 | 2a16117ac7a8 |
hex | 15070cd81579 |
23120024442233 has 2 divisors, whose sum is σ = 23120024442234. Its totient is φ = 23120024442232.
The previous prime is 23120024442217. The next prime is 23120024442239. The reversal of 23120024442233 is 33224442002132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22431940920169 + 688083522064 = 4736237^2 + 829508^2 .
It is a cyclic number.
It is not a de Polignac number, because 23120024442233 - 24 = 23120024442217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23120024442233.
It is not a weakly prime, because it can be changed into another prime (23120024442239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11560012221116 + 11560012221117.
It is an arithmetic number, because the mean of its divisors is an integer number (11560012221117).
Almost surely, 223120024442233 is an apocalyptic number.
It is an amenable number.
23120024442233 is a deficient number, since it is larger than the sum of its proper divisors (1).
23120024442233 is an equidigital number, since it uses as much as digits as its factorization.
23120024442233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 55296, while the sum is 32.
Adding to 23120024442233 its reverse (33224442002132), we get a palindrome (56344466444365).
The spelling of 23120024442233 in words is "twenty-three trillion, one hundred twenty billion, twenty-four million, four hundred forty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •