Base | Representation |
---|---|
bin | 100000010011100011101… |
… | …000101010001010000001 |
3 | 21212020021011110020202022 |
4 | 200103203220222022001 |
5 | 242333101141224301 |
6 | 4415510352331225 |
7 | 316251135304454 |
oct | 40234350521201 |
9 | 7766234406668 |
10 | 2220022211201 |
11 | 786562731673 |
12 | 2ba308b43b15 |
13 | 131468a36ba2 |
14 | 79641b9949b |
15 | 3cb34108d1b |
hex | 204e3a2a281 |
2220022211201 has 8 divisors (see below), whose sum is σ = 2256448459008. Its totient is φ = 2183597010000.
The previous prime is 2220022211179. The next prime is 2220022211213. The reversal of 2220022211201 is 1021122200222.
It is a happy number.
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 2220022211201 - 222 = 2220018016897 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 2220022211201.
It is not an unprimeable number, because it can be changed into a prime (2220022211801) 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, 4817726 + ... + 5258376.
It is an arithmetic number, because the mean of its divisors is an integer number (282056057376).
Almost surely, 22220022211201 is an apocalyptic number.
It is an amenable number.
2220022211201 is a deficient number, since it is larger than the sum of its proper divisors (36426247807).
2220022211201 is an equidigital number, since it uses as much as digits as its factorization.
2220022211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523303.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 2220022211201 its reverse (1021122200222), we get a palindrome (3241144411423).
The spelling of 2220022211201 in words is "two trillion, two hundred twenty billion, twenty-two million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •