Base | Representation |
---|---|
bin | 110010000001101110100001… |
… | …100011111010110101100001 |
3 | 1001212000210122210201021101010 |
4 | 302001232201203322311201 |
5 | 212314311002024020001 |
6 | 2055540130243131133 |
7 | 64225664331301551 |
oct | 6201564143726541 |
9 | 1055023583637333 |
10 | 220021000220001 |
11 | 64118422763502 |
12 | 20815663973aa9 |
13 | 959cb782338a6 |
14 | 3c49104d31161 |
15 | 1a683b78b78d6 |
hex | c81ba18fad61 |
220021000220001 has 8 divisors (see below), whose sum is σ = 303477241682880. Its totient is φ = 141622712785232.
The previous prime is 220021000219997. The next prime is 220021000220041. The reversal of 220021000220001 is 100022000120022.
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 220021000220001 - 22 = 220021000219997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (220021000220041) 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, 1264488506925 + ... + 1264488507098.
It is an arithmetic number, because the mean of its divisors is an integer number (37934655210360).
Almost surely, 2220021000220001 is an apocalyptic number.
It is an amenable number.
220021000220001 is a deficient number, since it is larger than the sum of its proper divisors (83456241462879).
220021000220001 is a wasteful number, since it uses less digits than its factorization.
220021000220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2528977014055.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 220021000220001 its reverse (100022000120022), we get a palindrome (320043000340023).
The spelling of 220021000220001 in words is "two hundred twenty trillion, twenty-one billion, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •