Base | Representation |
---|---|
bin | 110010000001011101000001… |
… | …000111001010011111010110 |
3 | 1001211222000010201220220201221 |
4 | 302001131001013022133112 |
5 | 212314004002230400042 |
6 | 2055523341052240554 |
7 | 64224430442620564 |
oct | 6201350107123726 |
9 | 1054860121826657 |
10 | 220002202200022 |
11 | 64110456772900 |
12 | 20811a9847015a |
13 | 959b170894748 |
14 | 3c48240532a34 |
15 | 1a67b67428d67 |
hex | c817411ca7d6 |
220002202200022 has 48 divisors (see below), whose sum is σ = 384110327963376. Its totient is φ = 94108220236800.
The previous prime is 220002202199809. The next prime is 220002202200023.
It is a happy number.
220002202200022 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 220002202199969 and 220002202200005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220002202200023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34459198 + ... + 40341550.
It is an arithmetic number, because the mean of its divisors is an integer number (8002298499237).
Almost surely, 2220002202200022 is an apocalyptic number.
220002202200022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
220002202200022 is a deficient number, since it is larger than the sum of its proper divisors (164108125763354).
220002202200022 is a wasteful number, since it uses less digits than its factorization.
220002202200022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5891485 (or 5891474 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 16.
It can be divided in two parts, 22000220 and 2200022, that added together give a palindrome (24200242).
The spelling of 220002202200022 in words is "two hundred twenty trillion, two billion, two hundred two million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •