Base | Representation |
---|---|
bin | 1000100111011101… |
… | …1100001110010001 |
3 | 12222012100012010022 |
4 | 2021313130032101 |
5 | 14214112341423 |
6 | 1021303513225 |
7 | 111214164356 |
oct | 21167341621 |
9 | 5865305108 |
10 | 2313012113 |
11 | a876a9265 |
12 | 546758815 |
13 | 2ab27ca29 |
14 | 17d29862d |
15 | d80e1dc8 |
hex | 89ddc391 |
2313012113 has 2 divisors, whose sum is σ = 2313012114. Its totient is φ = 2313012112.
The previous prime is 2313012071. The next prime is 2313012133. The reversal of 2313012113 is 3112103132.
2313012113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1498309264 + 814702849 = 38708^2 + 28543^2 .
It is a cyclic number.
It is not a de Polignac number, because 2313012113 - 26 = 2313012049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2313012091 and 2313012100.
It is not a weakly prime, because it can be changed into another prime (2313012133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1156506056 + 1156506057.
It is an arithmetic number, because the mean of its divisors is an integer number (1156506057).
Almost surely, 22313012113 is an apocalyptic number.
It is an amenable number.
2313012113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2313012113 is an equidigital number, since it uses as much as digits as its factorization.
2313012113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 2313012113 is about 48093.7845568427. The cubic root of 2313012113 is about 1322.4907275029.
Adding to 2313012113 its reverse (3112103132), we get a palindrome (5425115245).
The spelling of 2313012113 in words is "two billion, three hundred thirteen million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •