Base | Representation |
---|---|
bin | 1010100000101011010100… |
… | …01110111110010111011001 |
3 | 10000211120200210200010102101 |
4 | 11100111222032332113121 |
5 | 11012140411320031022 |
6 | 121053544412203401 |
7 | 4603600501522045 |
oct | 520255216762731 |
9 | 100746623603371 |
10 | 23113001330137 |
11 | 7401194772654 |
12 | 2713555469561 |
13 | cb871506c614 |
14 | 59c964ba9025 |
15 | 2a134ee2a627 |
hex | 15056a3be5d9 |
23113001330137 has 2 divisors, whose sum is σ = 23113001330138. Its totient is φ = 23113001330136.
The previous prime is 23113001330021. The next prime is 23113001330173. The reversal of 23113001330137 is 73103310031132.
Together with next prime (23113001330173) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17870073744601 + 5242927585536 = 4227301^2 + 2289744^2 .
It is a cyclic number.
It is not a de Polignac number, because 23113001330137 - 223 = 23112992941529 is a prime.
It is not a weakly prime, because it can be changed into another prime (23113001336137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11556500665068 + 11556500665069.
It is an arithmetic number, because the mean of its divisors is an integer number (11556500665069).
Almost surely, 223113001330137 is an apocalyptic number.
It is an amenable number.
23113001330137 is a deficient number, since it is larger than the sum of its proper divisors (1).
23113001330137 is an equidigital number, since it uses as much as digits as its factorization.
23113001330137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3402, while the sum is 28.
Adding to 23113001330137 its reverse (73103310031132), we get a palindrome (96216311361269).
The spelling of 23113001330137 in words is "twenty-three trillion, one hundred thirteen billion, one million, three hundred thirty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •