Base | Representation |
---|---|
bin | 10110101111001101010011… |
… | …010011100110100000001001 |
3 | 111010002000101002001101201201 |
4 | 112233031103103212200021 |
5 | 101101404244011401022 |
6 | 552403514133544201 |
7 | 30030562002163303 |
oct | 2657152323464011 |
9 | 433060332041651 |
10 | 100001121200137 |
11 | 29955267991463 |
12 | b270a791a5061 |
13 | 43a50b050a391 |
14 | 1a9a119aac973 |
15 | b863d2e42127 |
hex | 5af3534e6809 |
100001121200137 has 2 divisors, whose sum is σ = 100001121200138. Its totient is φ = 100001121200136.
The previous prime is 100001121200063. The next prime is 100001121200221. The reversal of 100001121200137 is 731002121100001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70477720800201 + 29523400399936 = 8395101^2 + 5433544^2 .
It is a cyclic number.
It is not a de Polignac number, because 100001121200137 - 215 = 100001121167369 is a prime.
It is not a weakly prime, because it can be changed into another prime (100001121200237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000560600068 + 50000560600069.
It is an arithmetic number, because the mean of its divisors is an integer number (50000560600069).
Almost surely, 2100001121200137 is an apocalyptic number.
It is an amenable number.
100001121200137 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001121200137 is an equidigital number, since it uses as much as digits as its factorization.
100001121200137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 100001121200137 its reverse (731002121100001), we get a palindrome (831003242300138).
The spelling of 100001121200137 in words is "one hundred trillion, one billion, one hundred twenty-one million, two hundred thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •