Base | Representation |
---|---|
bin | 111111110101100… |
… | …1100110010100101 |
3 | 12112021121110010222 |
4 | 1333223030302211 |
5 | 13341324443023 |
6 | 552315054125 |
7 | 104036651243 |
oct | 17753146245 |
9 | 5467543128 |
10 | 2142031013 |
11 | 9aa136671 |
12 | 4b9441345 |
13 | 281a15c95 |
14 | 1646ab793 |
15 | c80bacc8 |
hex | 7faccca5 |
2142031013 has 2 divisors, whose sum is σ = 2142031014. Its totient is φ = 2142031012.
The previous prime is 2142030959. The next prime is 2142031037. The reversal of 2142031013 is 3101302412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1749079684 + 392951329 = 41822^2 + 19823^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2142031013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2142030982 and 2142031000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2142031513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1071015506 + 1071015507.
It is an arithmetic number, because the mean of its divisors is an integer number (1071015507).
Almost surely, 22142031013 is an apocalyptic number.
It is an amenable number.
2142031013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2142031013 is an equidigital number, since it uses as much as digits as its factorization.
2142031013 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 2142031013 is about 46282.0809061131. The cubic root of 2142031013 is about 1289.0662900653.
Adding to 2142031013 its reverse (3101302412), we get a palindrome (5243333425).
The spelling of 2142031013 in words is "two billion, one hundred forty-two million, thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •