Base | Representation |
---|---|
bin | 1110000110110011010001… |
… | …01100001010111000111001 |
3 | 11001211111001211212201221122 |
4 | 13003121220230022320321 |
5 | 13031212440104033423 |
6 | 145550221310115025 |
7 | 6351056525252264 |
oct | 703315054127071 |
9 | 131744054781848 |
10 | 31020010221113 |
11 | 997a570097271 |
12 | 358ba767aba75 |
13 | 1440236250ac4 |
14 | 79353b1b9cdb |
15 | 38bd7d1298c8 |
hex | 1c3668b0ae39 |
31020010221113 has 2 divisors, whose sum is σ = 31020010221114. Its totient is φ = 31020010221112.
The previous prime is 31020010221073. The next prime is 31020010221139. The reversal of 31020010221113 is 31112201002013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18794973490489 + 12225036730624 = 4335317^2 + 3496432^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31020010221113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31020010221091 and 31020010221100.
It is not a weakly prime, because it can be changed into another prime (31020010271113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15510005110556 + 15510005110557.
It is an arithmetic number, because the mean of its divisors is an integer number (15510005110557).
Almost surely, 231020010221113 is an apocalyptic number.
It is an amenable number.
31020010221113 is a deficient number, since it is larger than the sum of its proper divisors (1).
31020010221113 is an equidigital number, since it uses as much as digits as its factorization.
31020010221113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 31020010221113 its reverse (31112201002013), we get a palindrome (62132211223126).
The spelling of 31020010221113 in words is "thirty-one trillion, twenty billion, ten million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •