Base | Representation |
---|---|
bin | 10011000110100000… |
… | …011101111100010000 |
3 | 1221221101200122000000 |
4 | 103012200131330100 |
5 | 314001112103300 |
6 | 13231114130000 |
7 | 1324156261131 |
oct | 230640357420 |
9 | 57841618000 |
10 | 20510269200 |
11 | 877556a903 |
12 | 3b84a20900 |
13 | 1c1b316c85 |
14 | dc7d91c88 |
15 | 800961c00 |
hex | 4c681df10 |
20510269200 has 420 divisors, whose sum is σ = 75916758948. Its totient is φ = 5318784000.
The previous prime is 20510269177. The next prime is 20510269211. The reversal of 20510269200 is 296201502.
It can be written as a sum of positive squares in 6 ways, for example, as 524226816 + 19986042384 = 22896^2 + 141372^2 .
It is a super-2 number, since 2×205102692002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 83 ways as a sum of consecutive naturals, for example, 10788250 + ... + 10790150.
Almost surely, 220510269200 is an apocalyptic number.
20510269200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20510269200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37958379474).
20510269200 is an abundant number, since it is smaller than the sum of its proper divisors (55406489748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20510269200 is a wasteful number, since it uses less digits than its factorization.
20510269200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1974 (or 1948 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The spelling of 20510269200 in words is "twenty billion, five hundred ten million, two hundred sixty-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •