Base | Representation |
---|---|
bin | 1100000010101… |
… | …01001010101001 |
3 | 21001001221121021 |
4 | 12001111022221 |
5 | 201324342022 |
6 | 14005012441 |
7 | 2334406012 |
oct | 601251251 |
9 | 231057537 |
10 | 101012137 |
11 | 52022a06 |
12 | 299b4121 |
13 | 17c093c5 |
14 | d5b6009 |
15 | 8d047c7 |
hex | 60552a9 |
101012137 has 2 divisors, whose sum is σ = 101012138. Its totient is φ = 101012136.
The previous prime is 101012089. The next prime is 101012141. The reversal of 101012137 is 731210101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 68624656 + 32387481 = 8284^2 + 5691^2 .
It is a cyclic number.
It is not a de Polignac number, because 101012137 - 223 = 92623529 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101012137.
It is not a weakly prime, because it can be changed into another prime (101012437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50506068 + 50506069.
It is an arithmetic number, because the mean of its divisors is an integer number (50506069).
Almost surely, 2101012137 is an apocalyptic number.
It is an amenable number.
101012137 is a deficient number, since it is larger than the sum of its proper divisors (1).
101012137 is an equidigital number, since it uses as much as digits as its factorization.
101012137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 16.
The square root of 101012137 is about 10050.4794413003. The cubic root of 101012137 is about 465.7196041997.
Adding to 101012137 its reverse (731210101), we get a palindrome (832222238).
The spelling of 101012137 in words is "one hundred one million, twelve thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •