Base | Representation |
---|---|
bin | 11001000011110001111111… |
… | …101000011011100000001001 |
3 | 112110020001212020021002012212 |
4 | 121003301333220123200021 |
5 | 103421144113020321301 |
6 | 1030222122503314505 |
7 | 32133324242120003 |
oct | 3103617750334011 |
9 | 473201766232185 |
10 | 110211002120201 |
11 | 32131250558114 |
12 | 1043b76974ba35 |
13 | 4965b11aab018 |
14 | 1d303532c5373 |
15 | cb1c939e44bb |
hex | 643c7fa1b809 |
110211002120201 has 2 divisors, whose sum is σ = 110211002120202. Its totient is φ = 110211002120200.
The previous prime is 110211002120059. The next prime is 110211002120299. The reversal of 110211002120201 is 102021200112011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109514111080201 + 696891040000 = 10464899^2 + 834800^2 .
It is a cyclic number.
It is not a de Polignac number, because 110211002120201 - 218 = 110211001858057 is a prime.
It is not a weakly prime, because it can be changed into another prime (110211002120701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55105501060100 + 55105501060101.
It is an arithmetic number, because the mean of its divisors is an integer number (55105501060101).
Almost surely, 2110211002120201 is an apocalyptic number.
It is an amenable number.
110211002120201 is a deficient number, since it is larger than the sum of its proper divisors (1).
110211002120201 is an equidigital number, since it uses as much as digits as its factorization.
110211002120201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110211002120201 its reverse (102021200112011), we get a palindrome (212232202232212).
The spelling of 110211002120201 in words is "one hundred ten trillion, two hundred eleven billion, two million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •