Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …00101001110100011010100 |
3 | 2220121111022000200011120222 |
4 | 11003011033211032203110 |
5 | 10402224214401041040 |
6 | 115115245004413512 |
7 | 4451020531445561 |
oct | 503051745164324 |
9 | 86544260604528 |
10 | 22202021112020 |
11 | 708a908126432 |
12 | 25a6a97b47298 |
13 | c508457c3c39 |
14 | 56a8253c1868 |
15 | 2877d396abb5 |
hex | 14314f94e8d4 |
22202021112020 has 48 divisors (see below), whose sum is σ = 50220784954368. Its totient is φ = 8220664193280.
The previous prime is 22202021111957. The next prime is 22202021112097. The reversal of 22202021112020 is 2021112020222.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 22202021112020.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 778457729 + ... + 778486248.
It is an arithmetic number, because the mean of its divisors is an integer number (1046266353216).
Almost surely, 222202021112020 is an apocalyptic number.
22202021112020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22202021112020 is an abundant number, since it is smaller than the sum of its proper divisors (28018763842348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22202021112020 is a wasteful number, since it uses less digits than its factorization.
22202021112020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1556944040 (or 1556944038 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 22202021112020 its reverse (2021112020222), we get a palindrome (24223133132242).
The spelling of 22202021112020 in words is "twenty-two trillion, two hundred two billion, twenty-one million, one hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •