Base | Representation |
---|---|
bin | 10110110000111100000001… |
… | …000010010001101101110111 |
3 | 111010111101012221111201001021 |
4 | 112300330001002101231313 |
5 | 101110331230000324002 |
6 | 552534254255242011 |
7 | 30042300635332135 |
oct | 2660740102215567 |
9 | 433441187451037 |
10 | 100120000011127 |
11 | 299a0720979698 |
12 | b28bb15519307 |
13 | 43b33773353a5 |
14 | 1aa1b9615c755 |
15 | b8953e778737 |
hex | 5b0f01091b77 |
100120000011127 has 2 divisors, whose sum is σ = 100120000011128. Its totient is φ = 100120000011126.
The previous prime is 100120000011121. The next prime is 100120000011133. The reversal of 100120000011127 is 721110000021001.
It is a balanced prime because it is at equal distance from previous prime (100120000011121) and next prime (100120000011133).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100120000011127 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100120000011127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100120000011121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060000005563 + 50060000005564.
It is an arithmetic number, because the mean of its divisors is an integer number (50060000005564).
Almost surely, 2100120000011127 is an apocalyptic number.
100120000011127 is a deficient number, since it is larger than the sum of its proper divisors (1).
100120000011127 is an equidigital number, since it uses as much as digits as its factorization.
100120000011127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 100120000011127 its reverse (721110000021001), we get a palindrome (821230000032128).
The spelling of 100120000011127 in words is "one hundred trillion, one hundred twenty billion, eleven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •