Base | Representation |
---|---|
bin | 1001000110101010001100… |
… | …10011001110000010011100 |
3 | 2121212220011202101222222010 |
4 | 10203111012103032002130 |
5 | 10111002001113310022 |
6 | 110325023211151220 |
7 | 4134253544215623 |
oct | 443250623160234 |
9 | 77786152358863 |
10 | 20020022010012 |
11 | 641949755a552 |
12 | 22b4020a45510 |
13 | b22b593c693b |
14 | 4d2d8d4326ba |
15 | 24ab779ed50c |
hex | 1235464ce09c |
20020022010012 has 24 divisors (see below), whose sum is σ = 49171983884800. Its totient is φ = 6322112213616.
The previous prime is 20020022010011. The next prime is 20020022010017. The reversal of 20020022010012 is 21001022002002.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a self number, because there is not a number n which added to its sum of digits gives 20020022010012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020022010011) by changing a digit.
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, 43903556812 + ... + 43903557267.
Almost surely, 220020022010012 is an apocalyptic number.
It is an amenable number.
20020022010012 is an abundant number, since it is smaller than the sum of its proper divisors (29151961874788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20020022010012 is a wasteful number, since it uses less digits than its factorization.
20020022010012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87807114105 (or 87807114103 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20020022010012 its reverse (21001022002002), we get a palindrome (41021044012014).
The spelling of 20020022010012 in words is "twenty trillion, twenty billion, twenty-two million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •