Base | Representation |
---|---|
bin | 1110001100001000001001… |
… | …11011001100110011000101 |
3 | 11002110222110010010110012211 |
4 | 13012010010323030303011 |
5 | 13042212241112030341 |
6 | 150210245225343421 |
7 | 6400225632062641 |
oct | 706040473146305 |
9 | 132428403113184 |
10 | 31203020033221 |
11 | 9a40143390873 |
12 | 35bb430337b71 |
13 | 1454580603a5a |
14 | 79c33ca13c21 |
15 | 3919debb4181 |
hex | 1c6104ecccc5 |
31203020033221 has 2 divisors, whose sum is σ = 31203020033222. Its totient is φ = 31203020033220.
The previous prime is 31203020033179. The next prime is 31203020033281. The reversal of 31203020033221 is 12233002030213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20552522513121 + 10650497520100 = 4533489^2 + 3263510^2 .
It is a cyclic number.
It is not a de Polignac number, because 31203020033221 - 235 = 31168660294853 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31203020033192 and 31203020033201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31203020033281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15601510016610 + 15601510016611.
It is an arithmetic number, because the mean of its divisors is an integer number (15601510016611).
Almost surely, 231203020033221 is an apocalyptic number.
It is an amenable number.
31203020033221 is a deficient number, since it is larger than the sum of its proper divisors (1).
31203020033221 is an equidigital number, since it uses as much as digits as its factorization.
31203020033221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 31203020033221 its reverse (12233002030213), we get a palindrome (43436022063434).
The spelling of 31203020033221 in words is "thirty-one trillion, two hundred three billion, twenty million, thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •