Base | Representation |
---|---|
bin | 11100110111110011… |
… | …110110101001100001 |
3 | 2222000112001121200101 |
4 | 130313303312221201 |
5 | 1001442241024022 |
6 | 22124113222401 |
7 | 2145144045133 |
oct | 346763665141 |
9 | 88015047611 |
10 | 31001111137 |
11 | 12169356707 |
12 | 6012261a01 |
13 | 2c00900c59 |
14 | 17013a5053 |
15 | c16979627 |
hex | 737cf6a61 |
31001111137 has 2 divisors, whose sum is σ = 31001111138. Its totient is φ = 31001111136.
The previous prime is 31001111111. The next prime is 31001111147. The reversal of 31001111137 is 73111110013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25574726241 + 5426384896 = 159921^2 + 73664^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31001111137 is a prime.
It is a super-2 number, since 2×310011111372 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31001111147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15500555568 + 15500555569.
It is an arithmetic number, because the mean of its divisors is an integer number (15500555569).
Almost surely, 231001111137 is an apocalyptic number.
It is an amenable number.
31001111137 is a deficient number, since it is larger than the sum of its proper divisors (1).
31001111137 is an equidigital number, since it uses as much as digits as its factorization.
31001111137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63, while the sum is 19.
The spelling of 31001111137 in words is "thirty-one billion, one million, one hundred eleven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •