Base | Representation |
---|---|
bin | 110000000001100000101111… |
… | …100101100011000001000001 |
3 | 1000200211111012201112201202011 |
4 | 300001200233211203001001 |
5 | 210140431301142320001 |
6 | 2025112330214052521 |
7 | 62326266265201516 |
oct | 6001405745430101 |
9 | 1020744181481664 |
10 | 211210110120001 |
11 | 61330782a21233 |
12 | 1b831b2664a141 |
13 | 90b1049467415 |
14 | 3a228a3ca730d |
15 | 19640d657dd51 |
hex | c0182f963041 |
211210110120001 has 32 divisors (see below), whose sum is σ = 221397526022400. Its totient is φ = 201108118573824.
The previous prime is 211210110119999. The next prime is 211210110120007. The reversal of 211210110120001 is 100021011012112.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 211210110120001 - 21 = 211210110119999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211210110120007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26097871911 + ... + 26097880003.
It is an arithmetic number, because the mean of its divisors is an integer number (6918672688200).
Almost surely, 2211210110120001 is an apocalyptic number.
It is an amenable number.
211210110120001 is a deficient number, since it is larger than the sum of its proper divisors (10187415902399).
211210110120001 is a wasteful number, since it uses less digits than its factorization.
211210110120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12345.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 211210110120001 its reverse (100021011012112), we get a palindrome (311231121132113).
The spelling of 211210110120001 in words is "two hundred eleven trillion, two hundred ten billion, one hundred ten million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •