Base | Representation |
---|---|
bin | 110011010001010001… |
… | …0101111110011100101 |
3 | 101112012010211110210222 |
4 | 1212202202233303211 |
5 | 3300441401400401 |
6 | 122325122454125 |
7 | 10645260521324 |
oct | 1464242576345 |
9 | 345163743728 |
10 | 110101200101 |
11 | 4276a291262 |
12 | 19408804345 |
13 | a4c8470a19 |
14 | 54868080bb |
15 | 2ce5e37c1b |
hex | 19a28afce5 |
110101200101 has 2 divisors, whose sum is σ = 110101200102. Its totient is φ = 110101200100.
The previous prime is 110101200007. The next prime is 110101200109. The reversal of 110101200101 is 101002101011.
It is a happy number.
It is an a-pointer prime, because the next prime (110101200109) can be obtained adding 110101200101 to its sum of digits (8).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94618375201 + 15482824900 = 307601^2 + 124430^2 .
It is a cyclic number.
It is not a de Polignac number, because 110101200101 - 218 = 110100937957 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110101200109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050600050 + 55050600051.
It is an arithmetic number, because the mean of its divisors is an integer number (55050600051).
Almost surely, 2110101200101 is an apocalyptic number.
It is an amenable number.
110101200101 is a deficient number, since it is larger than the sum of its proper divisors (1).
110101200101 is an equidigital number, since it uses as much as digits as its factorization.
110101200101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 110101200101 its reverse (101002101011), we get a palindrome (211103301112).
The spelling of 110101200101 in words is "one hundred ten billion, one hundred one million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •