Base | Representation |
---|---|
bin | 1110001001110011101101… |
… | …00100100111111100101001 |
3 | 11002012100201211212002221101 |
4 | 13010321312210213330221 |
5 | 13034411031004322423 |
6 | 150105505031241401 |
7 | 6361404640623424 |
oct | 704716644477451 |
9 | 132170654762841 |
10 | 31123322339113 |
11 | 9a0a366093674 |
12 | 35a7aa9819261 |
13 | 1449bbbcc6484 |
14 | 79853c08c9bb |
15 | 38e8c800c7ad |
hex | 1c4e76927f29 |
31123322339113 has 2 divisors, whose sum is σ = 31123322339114. Its totient is φ = 31123322339112.
The previous prime is 31123322339107. The next prime is 31123322339159. The reversal of 31123322339113 is 31193322332113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25896781076544 + 5226541262569 = 5088888^2 + 2286163^2 .
It is an emirp because it is prime and its reverse (31193322332113) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31123322339113 is a prime.
It is a super-2 number, since 2×311233223391132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31123322339413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15561661169556 + 15561661169557.
It is an arithmetic number, because the mean of its divisors is an integer number (15561661169557).
Almost surely, 231123322339113 is an apocalyptic number.
It is an amenable number.
31123322339113 is a deficient number, since it is larger than the sum of its proper divisors (1).
31123322339113 is an equidigital number, since it uses as much as digits as its factorization.
31123322339113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 52488, while the sum is 37.
The spelling of 31123322339113 in words is "thirty-one trillion, one hundred twenty-three billion, three hundred twenty-two million, three hundred thirty-nine thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •