Base | Representation |
---|---|
bin | 10010101000010001… |
… | …111000101010100101 |
3 | 1220122001102021211110 |
4 | 102220101320222211 |
5 | 311431300130041 |
6 | 13104520255233 |
7 | 1305460541220 |
oct | 225021705245 |
9 | 56561367743 |
10 | 20003130021 |
11 | 8535277716 |
12 | 3a63011519 |
13 | 1b6a232514 |
14 | d7a89c5b7 |
15 | 7c1188516 |
hex | 4a8478aa5 |
20003130021 has 16 divisors (see below), whose sum is σ = 30486400128. Its totient is φ = 11428320000.
The previous prime is 20003130011. The next prime is 20003130031. The reversal of 20003130021 is 12003130002.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20003130011) and next prime (20003130031).
It is not a de Polignac number, because 20003130021 - 26 = 20003129957 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20003129979 and 20003130006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20003130011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39721 + ... + 203921.
It is an arithmetic number, because the mean of its divisors is an integer number (1905400008).
Almost surely, 220003130021 is an apocalyptic number.
20003130021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20003130021 is a deficient number, since it is larger than the sum of its proper divisors (10483270107).
20003130021 is a wasteful number, since it uses less digits than its factorization.
20003130021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170012.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 20003130021 its reverse (12003130002), we get a palindrome (32006260023).
The spelling of 20003130021 in words is "twenty billion, three million, one hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •