Base | Representation |
---|---|
bin | 1010000110000111001000… |
… | …01110111010011000000110 |
3 | 2220121022122111202021200212 |
4 | 11003003210032322120012 |
5 | 10402212022321200402 |
6 | 115114350150435422 |
7 | 4450625102215142 |
oct | 503034416723006 |
9 | 86538574667625 |
10 | 22200220100102 |
11 | 708a073540530 |
12 | 25a6674962b72 |
13 | c5061963b405 |
14 | 56a6d4124222 |
15 | 28772a7b2952 |
hex | 1430e43ba606 |
22200220100102 has 64 divisors (see below), whose sum is σ = 41520956659200. Its totient is φ = 8771230702080.
The previous prime is 22200220100101. The next prime is 22200220100197. The reversal of 22200220100102 is 20100102200222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22200220100101) 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 31 ways as a sum of consecutive naturals, for example, 44247452 + ... + 44746367.
It is an arithmetic number, because the mean of its divisors is an integer number (648764947800).
Almost surely, 222200220100102 is an apocalyptic number.
22200220100102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22200220100102 is a deficient number, since it is larger than the sum of its proper divisors (19320736559098).
22200220100102 is a wasteful number, since it uses less digits than its factorization.
22200220100102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88993901.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 22200220100102 its reverse (20100102200222), we get a palindrome (42300322300324).
It can be divided in two parts, 22200220 and 100102, that added together give a palindrome (22300322).
The spelling of 22200220100102 in words is "twenty-two trillion, two hundred billion, two hundred twenty million, one hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •