Base | Representation |
---|---|
bin | 1001001001000011010001… |
… | …00011010000111001110110 |
3 | 2122011202021221201020202112 |
4 | 10210201220203100321312 |
5 | 10113323301430120042 |
6 | 110430453524411022 |
7 | 4143223165245242 |
oct | 444415043207166 |
9 | 78152257636675 |
10 | 20102201020022 |
11 | 645032845a050 |
12 | 2307b36546a72 |
13 | b2a824ac1194 |
14 | 4d6d47743422 |
15 | 24cd8743e982 |
hex | 1248688d0e76 |
20102201020022 has 16 divisors (see below), whose sum is σ = 34028804235600. Its totient is φ = 8822282579040.
The previous prime is 20102201020003. The next prime is 20102201020073. The reversal of 20102201020022 is 22002010220102.
It is a junction number, because it is equal to n+sod(n) for n = 20102201019979 and 20102201020006.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 15754075397 + ... + 15754076672.
It is an arithmetic number, because the mean of its divisors is an integer number (2126800264725).
Almost surely, 220102201020022 is an apocalyptic number.
20102201020022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20102201020022 is a deficient number, since it is larger than the sum of its proper divisors (13926603215578).
20102201020022 is a wasteful number, since it uses less digits than its factorization.
20102201020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31508152111.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 20102201020022 its reverse (22002010220102), we get a palindrome (42104211240124).
The spelling of 20102201020022 in words is "twenty trillion, one hundred two billion, two hundred one million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •