Base | Representation |
---|---|
bin | 1010011110010010111101… |
… | …00000000101011110110101 |
3 | 10000112202112221020121121122 |
4 | 11033021132200011132311 |
5 | 11004320344212014032 |
6 | 120552215352153325 |
7 | 4564643415603224 |
oct | 517113640053665 |
9 | 100482487217548 |
10 | 23031200110517 |
11 | 737a528049615 |
12 | 26bb726398845 |
13 | cb0aa9a0b5a1 |
14 | 598a04b1acbb |
15 | 29e163762012 |
hex | 14f25e8057b5 |
23031200110517 has 2 divisors, whose sum is σ = 23031200110518. Its totient is φ = 23031200110516.
The previous prime is 23031200110463. The next prime is 23031200110601. The reversal of 23031200110517 is 71501100213032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18061216522801 + 4969983587716 = 4249849^2 + 2229346^2 .
It is a cyclic number.
It is not a de Polignac number, because 23031200110517 - 228 = 23030931675061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23031200130517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11515600055258 + 11515600055259.
It is an arithmetic number, because the mean of its divisors is an integer number (11515600055259).
Almost surely, 223031200110517 is an apocalyptic number.
It is an amenable number.
23031200110517 is a deficient number, since it is larger than the sum of its proper divisors (1).
23031200110517 is an equidigital number, since it uses as much as digits as its factorization.
23031200110517 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 26.
Adding to 23031200110517 its reverse (71501100213032), we get a palindrome (94532300323549).
The spelling of 23031200110517 in words is "twenty-three trillion, thirty-one billion, two hundred million, one hundred ten thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •