Base | Representation |
---|---|
bin | 110011010100010000… |
… | …0010000010011110101 |
3 | 101112110010000111202001 |
4 | 1212220200100103311 |
5 | 3301143002210401 |
6 | 122343054215301 |
7 | 10650613554553 |
oct | 1465040202365 |
9 | 345403014661 |
10 | 110201210101 |
11 | 4281078a254 |
12 | 194361b4531 |
13 | a5130b8c38 |
14 | 5495bdcbd3 |
15 | 2ceeae0601 |
hex | 19a88104f5 |
110201210101 has 2 divisors, whose sum is σ = 110201210102. Its totient is φ = 110201210100.
The previous prime is 110201210099. The next prime is 110201210123. The reversal of 110201210101 is 101012102011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 58830987601 + 51370222500 = 242551^2 + 226650^2 .
It is a cyclic number.
It is not a de Polignac number, because 110201210101 - 21 = 110201210099 is a prime.
Together with 110201210099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110201210401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55100605050 + 55100605051.
It is an arithmetic number, because the mean of its divisors is an integer number (55100605051).
Almost surely, 2110201210101 is an apocalyptic number.
It is an amenable number.
110201210101 is a deficient number, since it is larger than the sum of its proper divisors (1).
110201210101 is an equidigital number, since it uses as much as digits as its factorization.
110201210101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110201210101 its reverse (101012102011), we get a palindrome (211213312112).
The spelling of 110201210101 in words is "one hundred ten billion, two hundred one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •