Base | Representation |
---|---|
bin | 1010000000111001101100… |
… | …11110001100000111011001 |
3 | 2212222012121001221110220122 |
4 | 11000130312132030013121 |
5 | 10341243420032211301 |
6 | 114500223233003025 |
7 | 4431660066601640 |
oct | 500346636140731 |
9 | 85865531843818 |
10 | 22021211210201 |
11 | 7020163700005 |
12 | 2577a370b3475 |
13 | c3978c140858 |
14 | 561b91c00357 |
15 | 282c500d181b |
hex | 14073678c1d9 |
22021211210201 has 8 divisors (see below), whose sum is σ = 25511853300864. Its totient is φ = 18616757813280.
The previous prime is 22021211210197. The next prime is 22021211210269. The reversal of 22021211210201 is 10201211212022.
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 22021211210201 - 22 = 22021211210197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22021211210201.
It is not an unprimeable number, because it can be changed into a prime (22021211210281) 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, 21547172885 + ... + 21547173906.
It is an arithmetic number, because the mean of its divisors is an integer number (3188981662608).
Almost surely, 222021211210201 is an apocalyptic number.
It is an amenable number.
22021211210201 is a deficient number, since it is larger than the sum of its proper divisors (3490642090663).
22021211210201 is an equidigital number, since it uses as much as digits as its factorization.
22021211210201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43094346871.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 22021211210201 its reverse (10201211212022), we get a palindrome (32222422422223).
The spelling of 22021211210201 in words is "twenty-two trillion, twenty-one billion, two hundred eleven million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •