Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …00111000101101111001110 |
3 | 2122121000101221221200201200 |
4 | 10212033113013011233032 |
5 | 10122241100111202342 |
6 | 111000540550450330 |
7 | 4154563642243416 |
oct | 446172707055716 |
9 | 78530357850650 |
10 | 20220020022222 |
11 | 6496298193249 |
12 | 23269379639a6 |
13 | b3898019b0b7 |
14 | 4dc923157646 |
15 | 250e80bcd94c |
hex | 1263d71c5bce |
20220020022222 has 24 divisors (see below), whose sum is σ = 45714827877264. Its totient is φ = 6446962905504.
The previous prime is 20220020022193. The next prime is 20220020022259. The reversal of 20220020022222 is 22222002002202.
20220020022222 is a `hidden beast` number, since 2 + 0 + 220 + 0 + 200 + 22 + 222 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 20220020022195 and 20220020022204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24420313623 + ... + 24420314450.
It is an arithmetic number, because the mean of its divisors is an integer number (1904784494886).
Almost surely, 220220020022222 is an apocalyptic number.
20220020022222 is an abundant number, since it is smaller than the sum of its proper divisors (25494807855042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20220020022222 is a wasteful number, since it uses less digits than its factorization.
20220020022222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48840628104 (or 48840628101 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 18.
Adding to 20220020022222 its reverse (22222002002202), we get a palindrome (42442022024424).
The spelling of 20220020022222 in words is "twenty trillion, two hundred twenty billion, twenty million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •