Base | Representation |
---|---|
bin | 10110101111010110100000… |
… | …101110110011001010101111 |
3 | 111010002221220020210002000021 |
4 | 112233112200232303022233 |
5 | 101102040022042011002 |
6 | 552412231311343011 |
7 | 30031362030423544 |
oct | 2657264056631257 |
9 | 433087806702007 |
10 | 100011010110127 |
11 | 29959481a1a946 |
12 | b272978b21a67 |
13 | 43a5cc81a02cc |
14 | 1a9a7b7194bcb |
15 | b867b11a9737 |
hex | 5af5a0bb32af |
100011010110127 has 2 divisors, whose sum is σ = 100011010110128. Its totient is φ = 100011010110126.
The previous prime is 100011010110101. The next prime is 100011010110133. The reversal of 100011010110127 is 721011010110001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100011010110127 - 215 = 100011010077359 is a prime.
It is a super-2 number, since 2×1000110101101272 (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 100011010110127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100011010113127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005505055063 + 50005505055064.
It is an arithmetic number, because the mean of its divisors is an integer number (50005505055064).
Almost surely, 2100011010110127 is an apocalyptic number.
100011010110127 is a deficient number, since it is larger than the sum of its proper divisors (1).
100011010110127 is an equidigital number, since it uses as much as digits as its factorization.
100011010110127 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 100011010110127 its reverse (721011010110001), we get a palindrome (821022020220128).
The spelling of 100011010110127 in words is "one hundred trillion, eleven billion, ten million, one hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •