Base | Representation |
---|---|
bin | 1110001001101101100001… |
… | …01111100110010010011001 |
3 | 11002012001011112112211102121 |
4 | 13010312300233212102121 |
5 | 13034332231322432004 |
6 | 150104155425301241 |
7 | 6361226456525563 |
oct | 704666057462231 |
9 | 132161145484377 |
10 | 31120003327129 |
11 | 9a08a12643862 |
12 | 35a7322194821 |
13 | 14497b04b8662 |
14 | 798305364333 |
15 | 38e781951854 |
hex | 1c4db0be6499 |
31120003327129 has 2 divisors, whose sum is σ = 31120003327130. Its totient is φ = 31120003327128.
The previous prime is 31120003327121. The next prime is 31120003327157. The reversal of 31120003327129 is 92172330002113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22522048147600 + 8597955179529 = 4745740^2 + 2932227^2 .
It is a cyclic number.
It is not a de Polignac number, because 31120003327129 - 23 = 31120003327121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31120003327094 and 31120003327103.
It is not a weakly prime, because it can be changed into another prime (31120003327121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15560001663564 + 15560001663565.
It is an arithmetic number, because the mean of its divisors is an integer number (15560001663565).
Almost surely, 231120003327129 is an apocalyptic number.
It is an amenable number.
31120003327129 is a deficient number, since it is larger than the sum of its proper divisors (1).
31120003327129 is an equidigital number, since it uses as much as digits as its factorization.
31120003327129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 34.
The spelling of 31120003327129 in words is "thirty-one trillion, one hundred twenty billion, three million, three hundred twenty-seven thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •