Base | Representation |
---|---|
bin | 10011000110010101… |
… | …110101111100010000 |
3 | 1221221012110010022111 |
4 | 103012111311330100 |
5 | 313444403441140 |
6 | 13230534315104 |
7 | 1324123510600 |
oct | 230625657420 |
9 | 57835403274 |
10 | 20507483920 |
11 | 8773a38220 |
12 | 3b83ab8a94 |
13 | 1c1a880291 |
14 | dc7868c00 |
15 | 8005b17ea |
hex | 4c6575f10 |
20507483920 has 240 divisors, whose sum is σ = 61142836608. Its totient is φ = 6324756480.
The previous prime is 20507483903. The next prime is 20507483923. The reversal of 20507483920 is 2938470502.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is not an unprimeable number, because it can be changed into a prime (20507483923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4180189 + ... + 4185091.
Almost surely, 220507483920 is an apocalyptic number.
20507483920 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 20507483920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30571418304).
20507483920 is an abundant number, since it is smaller than the sum of its proper divisors (40635352688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20507483920 is a wasteful number, since it uses less digits than its factorization.
20507483920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5038 (or 5025 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 20507483920 in words is "twenty billion, five hundred seven million, four hundred eighty-three thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •