Base | Representation |
---|---|
bin | 1110001001001000011100… |
… | …11111011011110111111101 |
3 | 11002010010210112101201011001 |
4 | 13010210032133123313331 |
5 | 13034021001413440442 |
6 | 150051104520130301 |
7 | 6356623334302054 |
oct | 704441637336775 |
9 | 132103715351131 |
10 | 31100101311997 |
11 | 9a0052a45a273 |
12 | 35a34a9006991 |
13 | 144795b1ca243 |
14 | 7973780a739b |
15 | 38deb95dd2b7 |
hex | 1c490e7dbdfd |
31100101311997 has 2 divisors, whose sum is σ = 31100101311998. Its totient is φ = 31100101311996.
The previous prime is 31100101311973. The next prime is 31100101312001. The reversal of 31100101311997 is 79911310100113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29854301560281 + 1245799751716 = 5463909^2 + 1116154^2 .
It is an emirp because it is prime and its reverse (79911310100113) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31100101311997 is a prime.
It is a super-2 number, since 2×311001013119972 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31100101311967) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15550050655998 + 15550050655999.
It is an arithmetic number, because the mean of its divisors is an integer number (15550050655999).
Almost surely, 231100101311997 is an apocalyptic number.
It is an amenable number.
31100101311997 is a deficient number, since it is larger than the sum of its proper divisors (1).
31100101311997 is an equidigital number, since it uses as much as digits as its factorization.
31100101311997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5103, while the sum is 37.
The spelling of 31100101311997 in words is "thirty-one trillion, one hundred billion, one hundred one million, three hundred eleven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •