Base | Representation |
---|---|
bin | 1001000110011011101000… |
… | …01000100001001001000110 |
3 | 2121212010222200211122101021 |
4 | 10203031310020201021012 |
5 | 10110334441430201042 |
6 | 110321251144221354 |
7 | 4133555666010436 |
oct | 443156410411106 |
9 | 77763880748337 |
10 | 20012201022022 |
11 | 641614383a510 |
12 | 22b25b976a85a |
13 | b221b0c9cab1 |
14 | 4d284a8462c6 |
15 | 24a86b0b3867 |
hex | 123374221246 |
20012201022022 has 8 divisors (see below), whose sum is σ = 32747238036072. Its totient is φ = 9096455010000.
The previous prime is 20012201022013. The next prime is 20012201022061. The reversal of 20012201022022 is 22022010221002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 20012201021987 and 20012201022005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 454822750479 + ... + 454822750522.
It is an arithmetic number, because the mean of its divisors is an integer number (4093404754509).
Almost surely, 220012201022022 is an apocalyptic number.
20012201022022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20012201022022 is a deficient number, since it is larger than the sum of its proper divisors (12735037014050).
20012201022022 is a wasteful number, since it uses less digits than its factorization.
20012201022022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909645501014.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 20012201022022 its reverse (22022010221002), we get a palindrome (42034211243024).
The spelling of 20012201022022 in words is "twenty trillion, twelve billion, two hundred one million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •