Base | Representation |
---|---|
bin | 1100110111010010111… |
… | …1110011110001110001 |
3 | 210010110000021221112010 |
4 | 3031310233303301301 |
5 | 12110103004201001 |
6 | 245305452153133 |
7 | 21652431122565 |
oct | 3156457636161 |
9 | 703400257463 |
10 | 221002022001 |
11 | 857a9975182 |
12 | 369b91687a9 |
13 | 17ac0491427 |
14 | a9a74bd6a5 |
15 | 5b371708d6 |
hex | 3374bf3c71 |
221002022001 has 8 divisors (see below), whose sum is σ = 301522138720. Its totient is φ = 143908293312.
The previous prime is 221002021993. The next prime is 221002022009. The reversal of 221002022001 is 100220200122.
It is an interprime number because it is at equal distance from previous prime (221002021993) and next prime (221002022009).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 221002022001 - 23 = 221002021993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221002022009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 856596856 + ... + 856597113.
It is an arithmetic number, because the mean of its divisors is an integer number (37690267340).
Almost surely, 2221002022001 is an apocalyptic number.
It is an amenable number.
221002022001 is a deficient number, since it is larger than the sum of its proper divisors (80520116719).
221002022001 is a wasteful number, since it uses less digits than its factorization.
221002022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1713194015.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 221002022001 its reverse (100220200122), we get a palindrome (321222222123).
The spelling of 221002022001 in words is "two hundred twenty-one billion, two million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •