Base | Representation |
---|---|
bin | 110011010001010001… |
… | …0000001001100000001 |
3 | 101112012010110202212211 |
4 | 1212202202001030001 |
5 | 3300441324243103 |
6 | 122325114422121 |
7 | 10645256064532 |
oct | 1464242011401 |
9 | 345163422784 |
10 | 110101009153 |
11 | 4276a170853 |
12 | 19408731941 |
13 | a4c8404b35 |
14 | 5486798689 |
15 | 2ce5deb36d |
hex | 19a2881301 |
110101009153 has 2 divisors, whose sum is σ = 110101009154. Its totient is φ = 110101009152.
The previous prime is 110101009129. The next prime is 110101009243. The reversal of 110101009153 is 351900101011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98811521649 + 11289487504 = 314343^2 + 106252^2 .
It is an emirp because it is prime and its reverse (351900101011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110101009153 is a prime.
It is not a weakly prime, because it can be changed into another prime (110101409153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050504576 + 55050504577.
It is an arithmetic number, because the mean of its divisors is an integer number (55050504577).
Almost surely, 2110101009153 is an apocalyptic number.
It is an amenable number.
110101009153 is a deficient number, since it is larger than the sum of its proper divisors (1).
110101009153 is an equidigital number, since it uses as much as digits as its factorization.
110101009153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 135, while the sum is 22.
The spelling of 110101009153 in words is "one hundred ten billion, one hundred one million, nine thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •