Base | Representation |
---|---|
bin | 1001001001000011010010… |
… | …01101111111010100111110 |
3 | 2122011202022201210021112202 |
4 | 10210201221031333110332 |
5 | 10113323312312021342 |
6 | 110430455004431502 |
7 | 4143223362404006 |
oct | 444415115772476 |
9 | 78152281707482 |
10 | 20102212220222 |
11 | 6450333809a10 |
12 | 2307b3a248592 |
13 | b2a827213112 |
14 | 4d6d4901b006 |
15 | 24cd88403332 |
hex | 12486937f53e |
20102212220222 has 8 divisors (see below), whose sum is σ = 32894529087672. Its totient is φ = 9137369191000.
The previous prime is 20102212220213. The next prime is 20102212220239. The reversal of 20102212220222 is 22202221220102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×201022122202222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20102212220194 and 20102212220203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 456868459529 + ... + 456868459572.
It is an arithmetic number, because the mean of its divisors is an integer number (4111816135959).
Almost surely, 220102212220222 is an apocalyptic number.
20102212220222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20102212220222 is a deficient number, since it is larger than the sum of its proper divisors (12792316867450).
20102212220222 is a wasteful number, since it uses less digits than its factorization.
20102212220222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 913736919114.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 20102212220222 its reverse (22202221220102), we get a palindrome (42304433440324).
The spelling of 20102212220222 in words is "twenty trillion, one hundred two billion, two hundred twelve million, two hundred twenty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •