Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …1111000001011001001101 |
3 | 1022210111221022212122110221 |
4 | 2103013300333001121031 |
5 | 2311120441340200414 |
6 | 33300303305431341 |
7 | 2062300505301253 |
oct | 223076077013115 |
9 | 38714838778427 |
10 | 10110101100109 |
11 | 324874055713a |
12 | 11734a449b551 |
13 | 5844bc59287a |
14 | 26d48d90c5d3 |
15 | 127ec0d5b224 |
hex | 931f0fc164d |
10110101100109 has 2 divisors, whose sum is σ = 10110101100110. Its totient is φ = 10110101100108.
The previous prime is 10110101100079. The next prime is 10110101100133. The reversal of 10110101100109 is 90100110101101.
10110101100109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10109633589225 + 467510884 = 3179565^2 + 21622^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110101100109 - 29 = 10110101099597 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10110101100092 and 10110101100101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110101100139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055050550054 + 5055050550055.
It is an arithmetic number, because the mean of its divisors is an integer number (5055050550055).
Almost surely, 210110101100109 is an apocalyptic number.
It is an amenable number.
10110101100109 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110101100109 is an equidigital number, since it uses as much as digits as its factorization.
10110101100109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 10110101100109 in words is "ten trillion, one hundred ten billion, one hundred one million, one hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •