Base | Representation |
---|---|
bin | 10010101001010100… |
… | …010000101101011100 |
3 | 1220200021011022010120 |
4 | 102221110100231130 |
5 | 312000223430022 |
6 | 13110341234540 |
7 | 1306061461110 |
oct | 225124205534 |
9 | 56607138116 |
10 | 20020530012 |
11 | 854408157a |
12 | 3a68a02a50 |
13 | 1b70a15382 |
14 | d7cd0b740 |
15 | 7c2973d5c |
hex | 4a9510b5c |
20020530012 has 96 divisors (see below), whose sum is σ = 56766044160. Its totient is φ = 5361054720.
The previous prime is 20020530001. The next prime is 20020530017. The reversal of 20020530012 is 21003502002.
It is a super-2 number, since 2×200205300122 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20020529973 and 20020530000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020530017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 311962 + ... + 370622.
It is an arithmetic number, because the mean of its divisors is an integer number (591312960).
Almost surely, 220020530012 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 20020530012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28383022080).
20020530012 is an abundant number, since it is smaller than the sum of its proper divisors (36745514148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20020530012 is a wasteful number, since it uses less digits than its factorization.
20020530012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58931 (or 58929 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 15.
The spelling of 20020530012 in words is "twenty billion, twenty million, five hundred thirty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •