Base | Representation |
---|---|
bin | 1110000110100110101000… |
… | …01001011001101010000101 |
3 | 11001210211112211201211121011 |
4 | 13003103110021121222011 |
5 | 13031110040104030201 |
6 | 145543140014522221 |
7 | 6350426402625154 |
oct | 703232411315205 |
9 | 131724484654534 |
10 | 31013223111301 |
11 | 99776a7a2a202 |
12 | 358a6a1806371 |
13 | 143c6c40963b2 |
14 | 793095a3959b |
15 | 38bad2364151 |
hex | 1c34d4259a85 |
31013223111301 has 2 divisors, whose sum is σ = 31013223111302. Its totient is φ = 31013223111300.
The previous prime is 31013223111271. The next prime is 31013223111319. The reversal of 31013223111301 is 10311132231013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30878570808801 + 134652302500 = 5556849^2 + 366950^2 .
It is an emirp because it is prime and its reverse (10311132231013) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31013223111301 - 29 = 31013223110789 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31013223111341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15506611555650 + 15506611555651.
It is an arithmetic number, because the mean of its divisors is an integer number (15506611555651).
Almost surely, 231013223111301 is an apocalyptic number.
It is an amenable number.
31013223111301 is a deficient number, since it is larger than the sum of its proper divisors (1).
31013223111301 is an equidigital number, since it uses as much as digits as its factorization.
31013223111301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 31013223111301 its reverse (10311132231013), we get a palindrome (41324355342314).
The spelling of 31013223111301 in words is "thirty-one trillion, thirteen billion, two hundred twenty-three million, one hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •