Base | Representation |
---|---|
bin | 10010101001010010… |
… | …001111010100010100 |
3 | 1220200020011101010020 |
4 | 102221102033110110 |
5 | 312000110000040 |
6 | 13110322025140 |
7 | 1306054122666 |
oct | 225122172424 |
9 | 56606141106 |
10 | 20020000020 |
11 | 854384a369 |
12 | 3a687a81b0 |
13 | 1b7088b077 |
14 | d7cc10536 |
15 | 7c28bbcd0 |
hex | 4a948f514 |
20020000020 has 48 divisors (see below), whose sum is σ = 59353414848. Its totient is φ = 5024627200.
The previous prime is 20019999991. The next prime is 20020000073. The reversal of 20020000020 is 2000002002.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a junction number, because it is equal to n+sod(n) for n = 20019999963 and 20020000008.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9812706 + ... + 9814745.
It is an arithmetic number, because the mean of its divisors is an integer number (1236529476).
Almost surely, 220020000020 is an apocalyptic number.
20020000020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20020000020 is an abundant number, since it is smaller than the sum of its proper divisors (39333414828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20020000020 is a wasteful number, since it uses less digits than its factorization.
20020000020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19627480 (or 19627478 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 6.
Adding to 20020000020 its reverse (2000002002), we get a palindrome (22020002022).
The spelling of 20020000020 in words is "twenty billion, twenty million, twenty", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •