Base | Representation |
---|---|
bin | 11110101110001110000… |
… | …011011010000100011101 |
3 | 21110211102000012222102122 |
4 | 132232032003122010131 |
5 | 234042230310401341 |
6 | 4253513312232325 |
7 | 305346543415655 |
oct | 36561603320435 |
9 | 7424360188378 |
10 | 2111212200221 |
11 | 7443a627a963 |
12 | 2a120083b6a5 |
13 | 124117c378c7 |
14 | 7427ca5b365 |
15 | 39db672094b |
hex | 1eb8e0da11d |
2111212200221 has 8 divisors (see below), whose sum is σ = 2151117492480. Its totient is φ = 2071309541392.
The previous prime is 2111212200187. The next prime is 2111212200259. The reversal of 2111212200221 is 1220022121112.
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 2111212200221 - 210 = 2111212199197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2111212200221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2111212208221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 999260 + ... + 2284938.
It is an arithmetic number, because the mean of its divisors is an integer number (268889686560).
Almost surely, 22111212200221 is an apocalyptic number.
It is an amenable number.
2111212200221 is a deficient number, since it is larger than the sum of its proper divisors (39905292259).
2111212200221 is a wasteful number, since it uses less digits than its factorization.
2111212200221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1316715.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 2111212200221 its reverse (1220022121112), we get a palindrome (3331234321333).
The spelling of 2111212200221 in words is "two trillion, one hundred eleven billion, two hundred twelve million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •