Base | Representation |
---|---|
bin | 100000001011010000000… |
… | …000101100001110011101 |
3 | 21211101020120110000100002 |
4 | 200023100000230032131 |
5 | 242211314334012341 |
6 | 4411433335344045 |
7 | 315514123446266 |
oct | 40132000541635 |
9 | 7741216400302 |
10 | 2211103032221 |
11 | 7827a6022476 |
12 | 2b8639b22025 |
13 | 130676c438a5 |
14 | 790373c196d |
15 | 3c7b109429b |
hex | 202d002c39d |
2211103032221 has 8 divisors (see below), whose sum is σ = 2211985661088. Its totient is φ = 2210220558000.
The previous prime is 2211103032217. The next prime is 2211103032239. The reversal of 2211103032221 is 1222303011122.
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 2211103032221 - 22 = 2211103032217 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2211103032193 and 2211103032202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2211103032211) 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, 34467386 + ... + 34531476.
It is an arithmetic number, because the mean of its divisors is an integer number (276498207636).
Almost surely, 22211103032221 is an apocalyptic number.
It is an amenable number.
2211103032221 is a deficient number, since it is larger than the sum of its proper divisors (882628867).
2211103032221 is an equidigital number, since it uses as much as digits as its factorization.
2211103032221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77323.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2211103032221 its reverse (1222303011122), we get a palindrome (3433406043343).
The spelling of 2211103032221 in words is "two trillion, two hundred eleven billion, one hundred three million, thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •