Base | Representation |
---|---|
bin | 1110001100011001000100… |
… | …10100011011100011011001 |
3 | 11002111211220010120010101111 |
4 | 13012030202110123203121 |
5 | 13042334341344333423 |
6 | 150214350415420321 |
7 | 6401000004050515 |
oct | 706144224334331 |
9 | 132454803503344 |
10 | 31212103121113 |
11 | 9a43a84572182 |
12 | 36011462246a1 |
13 | 145539a355a85 |
14 | 79c961097145 |
15 | 391d7230460d |
hex | 1c632251b8d9 |
31212103121113 has 2 divisors, whose sum is σ = 31212103121114. Its totient is φ = 31212103121112.
The previous prime is 31212103121081. The next prime is 31212103121117. The reversal of 31212103121113 is 31112130121213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31012112597904 + 199990523209 = 5568852^2 + 447203^2 .
It is a cyclic number.
It is not a de Polignac number, because 31212103121113 - 25 = 31212103121081 is a prime.
It is a super-3 number, since 3×312121031211133 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (31212103121117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15606051560556 + 15606051560557.
It is an arithmetic number, because the mean of its divisors is an integer number (15606051560557).
Almost surely, 231212103121113 is an apocalyptic number.
It is an amenable number.
31212103121113 is a deficient number, since it is larger than the sum of its proper divisors (1).
31212103121113 is an equidigital number, since it uses as much as digits as its factorization.
31212103121113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 31212103121113 its reverse (31112130121213), we get a palindrome (62324233242326).
The spelling of 31212103121113 in words is "thirty-one trillion, two hundred twelve billion, one hundred three million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •