Base | Representation |
---|---|
bin | 11101101111101000001… |
… | …01000100101111101011 |
3 | 10121200222002111000020111 |
4 | 32313310011010233223 |
5 | 113221030032020021 |
6 | 2101300142235151 |
7 | 133560111352033 |
oct | 16676405045753 |
9 | 3550862430214 |
10 | 1022002220011 |
11 | 3644796784a3 |
12 | 1460a2585ab7 |
13 | 754b3717136 |
14 | 376726048c3 |
15 | 1b8b81828e1 |
hex | edf4144beb |
1022002220011 has 8 divisors (see below), whose sum is σ = 1028192130000. Its totient is φ = 1015817648160.
The previous prime is 1022002219991. The next prime is 1022002220087. The reversal of 1022002220011 is 1100222002201.
It is a happy number.
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 1022002220011 - 27 = 1022002219883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022002219973 and 1022002220000.
It is not an unprimeable number, because it can be changed into a prime (1026002220011) 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, 950136 + ... + 1716613.
It is an arithmetic number, because the mean of its divisors is an integer number (128524016250).
Almost surely, 21022002220011 is an apocalyptic number.
1022002220011 is a deficient number, since it is larger than the sum of its proper divisors (6189909989).
1022002220011 is a wasteful number, since it uses less digits than its factorization.
1022002220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2669069.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1022002220011 its reverse (1100222002201), we get a palindrome (2122224222212).
The spelling of 1022002220011 in words is "one trillion, twenty-two billion, two million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •