Base | Representation |
---|---|
bin | 1010100000101011100100… |
… | …00110011001100110010001 |
3 | 10000211121000222222220012021 |
4 | 11100111302012121212101 |
5 | 11012141144111100423 |
6 | 121054005444531441 |
7 | 4603603663326133 |
oct | 520256206314621 |
9 | 100747028886167 |
10 | 23113133300113 |
11 | 740125220a64a |
12 | 27135916b0b81 |
13 | cb87364c796c |
14 | 59c97851d053 |
15 | 2a135b7e795d |
hex | 150572199991 |
23113133300113 has 2 divisors, whose sum is σ = 23113133300114. Its totient is φ = 23113133300112.
The previous prime is 23113133300039. The next prime is 23113133300119. The reversal of 23113133300113 is 31100333131132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18051137287569 + 5061996012544 = 4248663^2 + 2249888^2 .
It is a cyclic number.
It is not a de Polignac number, because 23113133300113 - 217 = 23113133169041 is a prime.
It is not a weakly prime, because it can be changed into another prime (23113133300119) 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, 11556566650056 + 11556566650057.
It is an arithmetic number, because the mean of its divisors is an integer number (11556566650057).
Almost surely, 223113133300113 is an apocalyptic number.
It is an amenable number.
23113133300113 is a deficient number, since it is larger than the sum of its proper divisors (1).
23113133300113 is an equidigital number, since it uses as much as digits as its factorization.
23113133300113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 23113133300113 its reverse (31100333131132), we get a palindrome (54213466431245).
The spelling of 23113133300113 in words is "twenty-three trillion, one hundred thirteen billion, one hundred thirty-three million, three hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •