Base | Representation |
---|---|
bin | 10100101100011011… |
… | …011000010000000001 |
3 | 2010100120020200110020 |
4 | 110230123120100001 |
5 | 331001333224301 |
6 | 14112520124053 |
7 | 1414431451566 |
oct | 245433302001 |
9 | 63316220406 |
10 | 22220211201 |
11 | 9472803611 |
12 | 4381606629 |
13 | 2131664886 |
14 | 110b10486d |
15 | 8a0b2b436 |
hex | 52c6d8401 |
22220211201 has 4 divisors (see below), whose sum is σ = 29626948272. Its totient is φ = 14813474132.
The previous prime is 22220211193. The next prime is 22220211203. The reversal of 22220211201 is 10211202222.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22220211201 - 23 = 22220211193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (22220211203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3703368531 + ... + 3703368536.
It is an arithmetic number, because the mean of its divisors is an integer number (7406737068).
Almost surely, 222220211201 is an apocalyptic number.
It is an amenable number.
22220211201 is a deficient number, since it is larger than the sum of its proper divisors (7406737071).
22220211201 is an equidigital number, since it uses as much as digits as its factorization.
22220211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7406737070.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 22220211201 its reverse (10211202222), we get a palindrome (32431413423).
It can be divided in two parts, 2222021 and 1201, that added together give a palindrome (2223222).
The spelling of 22220211201 in words is "twenty-two billion, two hundred twenty million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •