Base | Representation |
---|---|
bin | 11100110111101111… |
… | …100111101010111101 |
3 | 2222000102222020011002 |
4 | 130313233213222331 |
5 | 1001442000014323 |
6 | 22124033340045 |
7 | 2145131443166 |
oct | 346757475275 |
9 | 88012866132 |
10 | 31000001213 |
11 | 12168768815 |
12 | 6011a07625 |
13 | 2c006029ac |
14 | 170119676d |
15 | c1680a828 |
hex | 737be7abd |
31000001213 has 2 divisors, whose sum is σ = 31000001214. Its totient is φ = 31000001212.
The previous prime is 31000001189. The next prime is 31000001237. The reversal of 31000001213 is 31210000013.
It is a balanced prime because it is at equal distance from previous prime (31000001189) and next prime (31000001237).
It can be written as a sum of positive squares in only one way, i.e., 28621195684 + 2378805529 = 169178^2 + 48773^2 .
It is a cyclic number.
It is not a de Polignac number, because 31000001213 - 210 = 31000000189 is a prime.
It is a super-2 number, since 2×310000012132 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31000001194 and 31000001203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31000001713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15500000606 + 15500000607.
It is an arithmetic number, because the mean of its divisors is an integer number (15500000607).
Almost surely, 231000001213 is an apocalyptic number.
It is an amenable number.
31000001213 is a deficient number, since it is larger than the sum of its proper divisors (1).
31000001213 is an equidigital number, since it uses as much as digits as its factorization.
31000001213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 31000001213 its reverse (31210000013), we get a palindrome (62210001226).
The spelling of 31000001213 in words is "thirty-one billion, one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •