Base | Representation |
---|---|
bin | 101111000010000010… |
… | …0110110000000011101 |
3 | 100122200212112012101212 |
4 | 1132010010312000131 |
5 | 3123322012010414 |
6 | 114222050514205 |
7 | 10203606525263 |
oct | 1360404660035 |
9 | 318625465355 |
10 | 101000110109 |
11 | 39919a24688 |
12 | 176a8895965 |
13 | 96a7a87a82 |
14 | 4c61bda433 |
15 | 2961e3d83e |
hex | 178413601d |
101000110109 has 2 divisors, whose sum is σ = 101000110110. Its totient is φ = 101000110108.
The previous prime is 101000110103. The next prime is 101000110147. The reversal of 101000110109 is 901011000101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 66346426084 + 34653684025 = 257578^2 + 186155^2 .
It is a cyclic number.
It is not a de Polignac number, because 101000110109 - 212 = 101000106013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101000110093 and 101000110102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101000110103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500055054 + 50500055055.
It is an arithmetic number, because the mean of its divisors is an integer number (50500055055).
Almost surely, 2101000110109 is an apocalyptic number.
It is an amenable number.
101000110109 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000110109 is an equidigital number, since it uses as much as digits as its factorization.
101000110109 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 14.
The spelling of 101000110109 in words is "one hundred one billion, one hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •