Base | Representation |
---|---|
bin | 1110000110110011010001… |
… | …01111100110010111100101 |
3 | 11001211111001220120102010111 |
4 | 13003121220233212113211 |
5 | 13031212440321320401 |
6 | 145550221341253021 |
7 | 6351056536015243 |
oct | 703315057462745 |
9 | 131744056512114 |
10 | 31020011120101 |
11 | 997a570650733 |
12 | 358ba76b64171 |
13 | 14402364a7053 |
14 | 79353b371793 |
15 | 38bd7d255e51 |
hex | 1c3668be65e5 |
31020011120101 has 2 divisors, whose sum is σ = 31020011120102. Its totient is φ = 31020011120100.
The previous prime is 31020011120099. The next prime is 31020011120233. The reversal of 31020011120101 is 10102111002013.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27681004103076 + 3339007017025 = 5261274^2 + 1827295^2 .
It is a cyclic number.
It is not a de Polignac number, because 31020011120101 - 21 = 31020011120099 is a prime.
Together with 31020011120099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31020011120701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15510005560050 + 15510005560051.
It is an arithmetic number, because the mean of its divisors is an integer number (15510005560051).
Almost surely, 231020011120101 is an apocalyptic number.
It is an amenable number.
31020011120101 is a deficient number, since it is larger than the sum of its proper divisors (1).
31020011120101 is an equidigital number, since it uses as much as digits as its factorization.
31020011120101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 31020011120101 its reverse (10102111002013), we get a palindrome (41122122122114).
The spelling of 31020011120101 in words is "thirty-one trillion, twenty billion, eleven million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •