Base | Representation |
---|---|
bin | 1110000110100110011100… |
… | …00100010000110110101011 |
3 | 11001210211021201210012002021 |
4 | 13003103032010100312223 |
5 | 13031104333000214402 |
6 | 145543121532245311 |
7 | 6350424023561536 |
oct | 703231604206653 |
9 | 131724251705067 |
10 | 31013121101227 |
11 | 9977655395561 |
12 | 358a673610837 |
13 | 143c6a8bca9c5 |
14 | 793086283a1d |
15 | 38bac8413d37 |
hex | 1c34ce110dab |
31013121101227 has 2 divisors, whose sum is σ = 31013121101228. Its totient is φ = 31013121101226.
The previous prime is 31013121101213. The next prime is 31013121101239. The reversal of 31013121101227 is 72210112131013.
It is a strong prime.
It is an emirp because it is prime and its reverse (72210112131013) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31013121101227 - 211 = 31013121099179 is a prime.
It is not a weakly prime, because it can be changed into another prime (31013121101297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15506560550613 + 15506560550614.
It is an arithmetic number, because the mean of its divisors is an integer number (15506560550614).
Almost surely, 231013121101227 is an apocalyptic number.
31013121101227 is a deficient number, since it is larger than the sum of its proper divisors (1).
31013121101227 is an equidigital number, since it uses as much as digits as its factorization.
31013121101227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 25.
The spelling of 31013121101227 in words is "thirty-one trillion, thirteen billion, one hundred twenty-one million, one hundred one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •