Base | Representation |
---|---|
bin | 111111001011110… |
… | …0101101101110101 |
3 | 12110202100220022012 |
4 | 1332113211231311 |
5 | 13320222104023 |
6 | 550213214005 |
7 | 103352443334 |
oct | 17627455565 |
9 | 5422326265 |
10 | 2120113013 |
11 | 998826317 |
12 | 4b2031305 |
13 | 27a310855 |
14 | 161803d1b |
15 | c61db978 |
hex | 7e5e5b75 |
2120113013 has 2 divisors, whose sum is σ = 2120113014. Its totient is φ = 2120113012.
The previous prime is 2120113007. The next prime is 2120113031. The reversal of 2120113013 is 3103110212.
Together with next prime (2120113031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1100779684 + 1019333329 = 33178^2 + 31927^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120113013 - 24 = 2120112997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2120113913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060056506 + 1060056507.
It is an arithmetic number, because the mean of its divisors is an integer number (1060056507).
Almost surely, 22120113013 is an apocalyptic number.
It is an amenable number.
2120113013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120113013 is an equidigital number, since it uses as much as digits as its factorization.
2120113013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 2120113013 is about 46044.6849592871. The cubic root of 2120113013 is about 1284.6544843631.
Adding to 2120113013 its reverse (3103110212), we get a palindrome (5223223225).
The spelling of 2120113013 in words is "two billion, one hundred twenty million, one hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •