Base | Representation |
---|---|
bin | 10010101001011001… |
… | …111110111010111100 |
3 | 1220200100222111202010 |
4 | 102221121332322330 |
5 | 312001114430022 |
6 | 13110433331220 |
7 | 1306110306225 |
oct | 225131767274 |
9 | 56610874663 |
10 | 20022030012 |
11 | 8544a06546 |
12 | 3a69406b10 |
13 | 1b7111c04a |
14 | d7d1bc24c |
15 | 7c2b6d50c |
hex | 4a967eebc |
20022030012 has 72 divisors (see below), whose sum is σ = 50522124240. Its totient is φ = 6163646720.
The previous prime is 20022030001. The next prime is 20022030029. The reversal of 20022030012 is 21003022002.
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 20022030012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 129712 + ... + 238472.
It is an arithmetic number, because the mean of its divisors is an integer number (701696170).
Almost surely, 220022030012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20022030012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25261062120).
20022030012 is an abundant number, since it is smaller than the sum of its proper divisors (30500094228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20022030012 is a wasteful number, since it uses less digits than its factorization.
20022030012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108843 (or 108818 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 20022030012 its reverse (21003022002), we get a palindrome (41025052014).
The spelling of 20022030012 in words is "twenty billion, twenty-two million, thirty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •