Base | Representation |
---|---|
bin | 10110110000101001011111… |
… | …100100000110100011011111 |
3 | 111010102110212212000100020221 |
4 | 112300221133210012203133 |
5 | 101110020011420201002 |
6 | 552521204535022211 |
7 | 30040665032353645 |
oct | 2660513744064337 |
9 | 433373785010227 |
10 | 100100111100127 |
11 | 29993245125466 |
12 | b2880a480a967 |
13 | 43b15279846b8 |
14 | 1aa0c2a913195 |
15 | b88c78652c37 |
hex | 5b0a5f9068df |
100100111100127 has 2 divisors, whose sum is σ = 100100111100128. Its totient is φ = 100100111100126.
The previous prime is 100100111100029. The next prime is 100100111100137. The reversal of 100100111100127 is 721001111001001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100100111100127 is a prime.
It is a super-2 number, since 2×1001001111001272 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100100111100127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100100111100137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050055550063 + 50050055550064.
It is an arithmetic number, because the mean of its divisors is an integer number (50050055550064).
Almost surely, 2100100111100127 is an apocalyptic number.
100100111100127 is a deficient number, since it is larger than the sum of its proper divisors (1).
100100111100127 is an equidigital number, since it uses as much as digits as its factorization.
100100111100127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 16.
Adding to 100100111100127 its reverse (721001111001001), we get a palindrome (821101222101128).
The spelling of 100100111100127 in words is "one hundred trillion, one hundred billion, one hundred eleven million, one hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •