Base | Representation |
---|---|
bin | 1110001100001000001000… |
… | …11001111001001011101001 |
3 | 11002110222102111200212101202 |
4 | 13012010010121321023221 |
5 | 13042212231343131441 |
6 | 150210244314253545 |
7 | 6400225464626561 |
oct | 706040431711351 |
9 | 132428374625352 |
10 | 31203011302121 |
11 | 9a40139467a8a |
12 | 35bb4294272b5 |
13 | 145457b867919 |
14 | 79c33b7bdda1 |
15 | 3919de03c19b |
hex | 1c61046792e9 |
31203011302121 has 2 divisors, whose sum is σ = 31203011302122. Its totient is φ = 31203011302120.
The previous prime is 31203011302097. The next prime is 31203011302129. The reversal of 31203011302121 is 12120311030213.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21017090113600 + 10185921188521 = 4584440^2 + 3191539^2 .
It is a cyclic number.
It is not a de Polignac number, because 31203011302121 - 210 = 31203011301097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31203011302093 and 31203011302102.
It is not a weakly prime, because it can be changed into another prime (31203011302129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15601505651060 + 15601505651061.
It is an arithmetic number, because the mean of its divisors is an integer number (15601505651061).
Almost surely, 231203011302121 is an apocalyptic number.
It is an amenable number.
31203011302121 is a deficient number, since it is larger than the sum of its proper divisors (1).
31203011302121 is an equidigital number, since it uses as much as digits as its factorization.
31203011302121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 31203011302121 its reverse (12120311030213), we get a palindrome (43323322332334).
The spelling of 31203011302121 in words is "thirty-one trillion, two hundred three billion, eleven million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •