Base | Representation |
---|---|
bin | 1110001001011011000100… |
… | …11101111001110100101001 |
3 | 11002011002121100221100101222 |
4 | 13010231202131321310221 |
5 | 13034201441113143423 |
6 | 150055441021351425 |
7 | 6360426165665153 |
oct | 704554235716451 |
9 | 132132540840358 |
10 | 31110100131113 |
11 | 9a047a0538043 |
12 | 35a5419708575 |
13 | 1448892893063 |
14 | 797a45dddad3 |
15 | 38e3a23163c8 |
hex | 1c4b62779d29 |
31110100131113 has 2 divisors, whose sum is σ = 31110100131114. Its totient is φ = 31110100131112.
The previous prime is 31110100131083. The next prime is 31110100131127. The reversal of 31110100131113 is 31113100101113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27613637697424 + 3496462433689 = 5254868^2 + 1869883^2 .
It is a cyclic number.
It is not a de Polignac number, because 31110100131113 - 26 = 31110100131049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31110100131091 and 31110100131100.
It is not a weakly prime, because it can be changed into another prime (31110100131613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15555050065556 + 15555050065557.
It is an arithmetic number, because the mean of its divisors is an integer number (15555050065557).
Almost surely, 231110100131113 is an apocalyptic number.
It is an amenable number.
31110100131113 is a deficient number, since it is larger than the sum of its proper divisors (1).
31110100131113 is an equidigital number, since it uses as much as digits as its factorization.
31110100131113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 31110100131113 its reverse (31113100101113), we get a palindrome (62223200232226).
The spelling of 31110100131113 in words is "thirty-one trillion, one hundred ten billion, one hundred million, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •