Base | Representation |
---|---|
bin | 10110101111010110100001… |
… | …011000110001001100111111 |
3 | 111010002221221000111000220202 |
4 | 112233112201120301030333 |
5 | 101102040032401042002 |
6 | 552412232343234115 |
7 | 30031362223065416 |
oct | 2657264130611477 |
9 | 433087830430822 |
10 | 100011021112127 |
11 | 29959488154904 |
12 | b27298074893b |
13 | 43a5cca552c78 |
14 | 1a9a7b881a47d |
15 | b867b212e502 |
hex | 5af5a163133f |
100011021112127 has 2 divisors, whose sum is σ = 100011021112128. Its totient is φ = 100011021112126.
The previous prime is 100011021112109. The next prime is 100011021112217. The reversal of 100011021112127 is 721211120110001.
It is a happy number.
Together with next prime (100011021112217) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100011021112127 - 28 = 100011021111871 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100011021112099 and 100011021112108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100011021112727) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005510556063 + 50005510556064.
It is an arithmetic number, because the mean of its divisors is an integer number (50005510556064).
Almost surely, 2100011021112127 is an apocalyptic number.
100011021112127 is a deficient number, since it is larger than the sum of its proper divisors (1).
100011021112127 is an equidigital number, since it uses as much as digits as its factorization.
100011021112127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 100011021112127 its reverse (721211120110001), we get a palindrome (821222141222128).
The spelling of 100011021112127 in words is "one hundred trillion, eleven billion, twenty-one million, one hundred twelve thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •