Base | Representation |
---|---|
bin | 1010100000111000011000… |
… | …01010011010110010000101 |
3 | 10000212020210110101110211222 |
4 | 11100130030022122302011 |
5 | 11012244241312341401 |
6 | 121101104245010125 |
7 | 4604236322034365 |
oct | 520341412326205 |
9 | 100766713343758 |
10 | 23120013012101 |
11 | 7404162676035 |
12 | 27149916b3945 |
13 | cb9291905865 |
14 | 59d02c0c69a5 |
15 | 2a16107a0c1b |
hex | 15070c29ac85 |
23120013012101 has 2 divisors, whose sum is σ = 23120013012102. Its totient is φ = 23120013012100.
The previous prime is 23120013012077. The next prime is 23120013012143. The reversal of 23120013012101 is 10121031002132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20018698299076 + 3101314713025 = 4474226^2 + 1761055^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23120013012101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23120013012101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23120013012401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11560006506050 + 11560006506051.
It is an arithmetic number, because the mean of its divisors is an integer number (11560006506051).
Almost surely, 223120013012101 is an apocalyptic number.
It is an amenable number.
23120013012101 is a deficient number, since it is larger than the sum of its proper divisors (1).
23120013012101 is an equidigital number, since it uses as much as digits as its factorization.
23120013012101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 23120013012101 its reverse (10121031002132), we get a palindrome (33241044014233).
The spelling of 23120013012101 in words is "twenty-three trillion, one hundred twenty billion, thirteen million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •