Base | Representation |
---|---|
bin | 101111000101010100… |
… | …0000101010011100101 |
3 | 100122222112022202020021 |
4 | 1132022220011103211 |
5 | 3124033130323414 |
6 | 114241014235141 |
7 | 10206412625332 |
oct | 1361250052345 |
9 | 318875282207 |
10 | 101110011109 |
11 | 39975a68958 |
12 | 17719655ab1 |
13 | 96c4787053 |
14 | 4c72647989 |
15 | 296b8ebc24 |
hex | 178aa054e5 |
101110011109 has 2 divisors, whose sum is σ = 101110011110. Its totient is φ = 101110011108.
The previous prime is 101110011061. The next prime is 101110011113. The reversal of 101110011109 is 901110011101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100792280484 + 317730625 = 317478^2 + 17825^2 .
It is a cyclic number.
It is not a de Polignac number, because 101110011109 - 215 = 101109978341 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101110011092 and 101110011101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101110011139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555005554 + 50555005555.
It is an arithmetic number, because the mean of its divisors is an integer number (50555005555).
Almost surely, 2101110011109 is an apocalyptic number.
It is an amenable number.
101110011109 is a deficient number, since it is larger than the sum of its proper divisors (1).
101110011109 is an equidigital number, since it uses as much as digits as its factorization.
101110011109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 101110011109 in words is "one hundred one billion, one hundred ten million, eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •