Base | Representation |
---|---|
bin | 100000001010010100111… |
… | …101000000110011111101 |
3 | 21211021200112001010211001 |
4 | 200022110331000303331 |
5 | 242202302211242341 |
6 | 4411151142530301 |
7 | 315450432561244 |
oct | 40122475006375 |
9 | 7737615033731 |
10 | 2210112212221 |
11 | 7823377a9771 |
12 | 2b8402136991 |
13 | 13054989bc74 |
14 | 78d8198395b |
15 | 3c7540c7d31 |
hex | 20294f40cfd |
2210112212221 has 8 divisors (see below), whose sum is σ = 2222790504480. Its totient is φ = 2197437601392.
The previous prime is 2210112212213. The next prime is 2210112212227. The reversal of 2210112212221 is 1222122110122.
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 2210112212221 - 23 = 2210112212213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2210112212227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 288306 + ... + 2122108.
It is an arithmetic number, because the mean of its divisors is an integer number (277848813060).
Almost surely, 22210112212221 is an apocalyptic number.
It is an amenable number.
2210112212221 is a deficient number, since it is larger than the sum of its proper divisors (12678292259).
2210112212221 is a wasteful number, since it uses less digits than its factorization.
2210112212221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1840715.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 2210112212221 its reverse (1222122110122), we get a palindrome (3432234322343).
The spelling of 2210112212221 in words is "two trillion, two hundred ten billion, one hundred twelve million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •