Base | Representation |
---|---|
bin | 10010110101011001… |
… | …11000100101011001 |
3 | 222002200212001022122 |
4 | 21122230320211121 |
5 | 131202040301022 |
6 | 4351211431025 |
7 | 505401415361 |
oct | 113254704531 |
9 | 28080761278 |
10 | 10111650137 |
11 | 4319843456 |
12 | 1b62455475 |
13 | c51b7c944 |
14 | 6bcd079a1 |
15 | 3e2ab4742 |
hex | 25ab38959 |
10111650137 has 2 divisors, whose sum is σ = 10111650138. Its totient is φ = 10111650136.
The previous prime is 10111650127. The next prime is 10111650151. The reversal of 10111650137 is 73105611101.
10111650137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8772382921 + 1339267216 = 93661^2 + 36596^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111650137 - 232 = 5816682841 is a prime.
It is not a weakly prime, because it can be changed into another prime (10111650127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055825068 + 5055825069.
It is an arithmetic number, because the mean of its divisors is an integer number (5055825069).
Almost surely, 210111650137 is an apocalyptic number.
It is an amenable number.
10111650137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111650137 is an equidigital number, since it uses as much as digits as its factorization.
10111650137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 26.
The spelling of 10111650137 in words is "ten billion, one hundred eleven million, six hundred fifty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •