Base | Representation |
---|---|
bin | 1110001001100000011111… |
… | …11010111110100001011011 |
3 | 11002011101010011202201102002 |
4 | 13010300033322332201123 |
5 | 13034223421103222112 |
6 | 150101041454431215 |
7 | 6360561253156622 |
oct | 704601772764133 |
9 | 132141104681362 |
10 | 31113010210907 |
11 | 9a05a54171069 |
12 | 35a5ab020250b |
13 | 1448c37752a71 |
14 | 797c406ba6b9 |
15 | 38e4c2a471c2 |
hex | 1c4c0febe85b |
31113010210907 has 2 divisors, whose sum is σ = 31113010210908. Its totient is φ = 31113010210906.
The previous prime is 31113010210897. The next prime is 31113010211011. The reversal of 31113010210907 is 70901201031113.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31113010210907 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31113010210907.
It is not a weakly prime, because it can be changed into another prime (31113010210507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15556505105453 + 15556505105454.
It is an arithmetic number, because the mean of its divisors is an integer number (15556505105454).
Almost surely, 231113010210907 is an apocalyptic number.
31113010210907 is a deficient number, since it is larger than the sum of its proper divisors (1).
31113010210907 is an equidigital number, since it uses as much as digits as its factorization.
31113010210907 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 29.
The spelling of 31113010210907 in words is "thirty-one trillion, one hundred thirteen billion, ten million, two hundred ten thousand, nine hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •