Base | Representation |
---|---|
bin | 110010000001100101011010… |
… | …000001001100111001010001 |
3 | 1001211222212101111200200001110 |
4 | 302001211122001030321101 |
5 | 212314130424230031001 |
6 | 2055531430552523533 |
7 | 64225166611645125 |
oct | 6201453201147121 |
9 | 1054885344620043 |
10 | 220011210002001 |
11 | 64114259402850 |
12 | 208137910b05a9 |
13 | 959bc77b46ca2 |
14 | 3c488569b9585 |
15 | 1a67ee31473d6 |
hex | c8195a04ce51 |
220011210002001 has 64 divisors (see below), whose sum is σ = 332526409399296. Its totient is φ = 128216952864000.
The previous prime is 220011210001991. The next prime is 220011210002021. The reversal of 220011210002001 is 100200012110022.
It is not a de Polignac number, because 220011210002001 - 211 = 220011209999953 is a prime.
It is not an unprimeable number, because it can be changed into a prime (220011210002021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 65825826 + ... + 69087348.
It is an arithmetic number, because the mean of its divisors is an integer number (5195725146864).
Almost surely, 2220011210002001 is an apocalyptic number.
It is an amenable number.
220011210002001 is a deficient number, since it is larger than the sum of its proper divisors (112515199397295).
220011210002001 is a wasteful number, since it uses less digits than its factorization.
220011210002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3262222.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 220011210002001 its reverse (100200012110022), we get a palindrome (320211222112023).
It can be divided in two parts, 220011 and 210002001, that added together give a palindrome (210222012).
The spelling of 220011210002001 in words is "two hundred twenty trillion, eleven billion, two hundred ten million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •