Base | Representation |
---|---|
bin | 1110001001001000110110… |
… | …00111000101000110010001 |
3 | 11002010011100021210011002201 |
4 | 13010210123013011012101 |
5 | 13034021420113443212 |
6 | 150051141522043201 |
7 | 6356631515005564 |
oct | 704443307050621 |
9 | 132104307704081 |
10 | 31100313031057 |
11 | 9a00628a169a6 |
12 | 35a3547aa9501 |
13 | 14479930286aa |
14 | 79739825a4db |
15 | 38decceaeb57 |
hex | 1c491b1c5191 |
31100313031057 has 2 divisors, whose sum is σ = 31100313031058. Its totient is φ = 31100313031056.
The previous prime is 31100313030977. The next prime is 31100313031127. The reversal of 31100313031057 is 75013031300113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30113709859216 + 986603171841 = 5487596^2 + 993279^2 .
It is a cyclic number.
It is not a de Polignac number, because 31100313031057 - 27 = 31100313030929 is a prime.
It is a super-3 number, since 3×311003130310573 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (31100313031757) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15550156515528 + 15550156515529.
It is an arithmetic number, because the mean of its divisors is an integer number (15550156515529).
Almost surely, 231100313031057 is an apocalyptic number.
It is an amenable number.
31100313031057 is a deficient number, since it is larger than the sum of its proper divisors (1).
31100313031057 is an equidigital number, since it uses as much as digits as its factorization.
31100313031057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2835, while the sum is 28.
The spelling of 31100313031057 in words is "thirty-one trillion, one hundred billion, three hundred thirteen million, thirty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •