Base | Representation |
---|---|
bin | 11001000011100111110101… |
… | …110111111101101111011001 |
3 | 112110012000201111212220120202 |
4 | 121003213311313331233121 |
5 | 103421004301324032301 |
6 | 1030213121050431545 |
7 | 32132460143131610 |
oct | 3103476567755731 |
9 | 473160644786522 |
10 | 110200101002201 |
11 | 32127667117891 |
12 | 10439626a325b5 |
13 | 4964a954c5342 |
14 | 1d2d9db5d4877 |
15 | cb185698866b |
hex | 6439f5dfdbd9 |
110200101002201 has 8 divisors (see below), whose sum is σ = 125972377925184. Its totient is φ = 94435175417040.
The previous prime is 110200101002113. The next prime is 110200101002227. The reversal of 110200101002201 is 102200101002011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110200101002201 - 226 = 110200033893337 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110200101002281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1837802330 + ... + 1837862291.
It is an arithmetic number, because the mean of its divisors is an integer number (15746547240648).
Almost surely, 2110200101002201 is an apocalyptic number.
It is an amenable number.
110200101002201 is a deficient number, since it is larger than the sum of its proper divisors (15772276922983).
110200101002201 is an equidigital number, since it uses as much as digits as its factorization.
110200101002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3675668911.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110200101002201 its reverse (102200101002011), we get a palindrome (212400202004212).
The spelling of 110200101002201 in words is "one hundred ten trillion, two hundred billion, one hundred one million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •