Base | Representation |
---|---|
bin | 111100100010101… |
… | …0000001011010001 |
3 | 12020120110211111222 |
4 | 1321011100023101 |
5 | 13130020420423 |
6 | 533324214425 |
7 | 101224533422 |
oct | 17105201321 |
9 | 5216424458 |
10 | 2031420113 |
11 | 952757aa8 |
12 | 48839a415 |
13 | 264b28848 |
14 | 153b17649 |
15 | bd51c3c8 |
hex | 791502d1 |
2031420113 has 2 divisors, whose sum is σ = 2031420114. Its totient is φ = 2031420112.
The previous prime is 2031420107. The next prime is 2031420133. The reversal of 2031420113 is 3110241302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1375445569 + 655974544 = 37087^2 + 25612^2 .
It is a cyclic number.
It is not a de Polignac number, because 2031420113 - 28 = 2031419857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2031420091 and 2031420100.
It is not a weakly prime, because it can be changed into another prime (2031420133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1015710056 + 1015710057.
It is an arithmetic number, because the mean of its divisors is an integer number (1015710057).
Almost surely, 22031420113 is an apocalyptic number.
It is an amenable number.
2031420113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2031420113 is an equidigital number, since it uses as much as digits as its factorization.
2031420113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2031420113 is about 45071.2781380781. The cubic root of 2031420113 is about 1266.4846079597.
Adding to 2031420113 its reverse (3110241302), we get a palindrome (5141661415).
The spelling of 2031420113 in words is "two billion, thirty-one million, four hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •