Base | Representation |
---|---|
bin | 10010111101000001… |
… | …000000011110001000 |
3 | 1221112022001021212201 |
4 | 102331001000132020 |
5 | 313134330331310 |
6 | 13203225045544 |
7 | 1320213606316 |
oct | 227501003610 |
9 | 57468037781 |
10 | 20351027080 |
11 | 86a369594a |
12 | 3b3b6268b4 |
13 | 1bc4330477 |
14 | db0b7d0b6 |
15 | 7e19a8e3a |
hex | 4bd040788 |
20351027080 has 64 divisors (see below), whose sum is σ = 48737479680. Its totient is φ = 7621401600.
The previous prime is 20351027041. The next prime is 20351027087. The reversal of 20351027080 is 8072015302.
It is not an unprimeable number, because it can be changed into a prime (20351027087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51535 + ... + 208225.
It is an arithmetic number, because the mean of its divisors is an integer number (761523120).
Almost surely, 220351027080 is an apocalyptic number.
20351027080 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 20351027080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24368739840).
20351027080 is an abundant number, since it is smaller than the sum of its proper divisors (28386452600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20351027080 is a wasteful number, since it uses less digits than its factorization.
20351027080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156910 (or 156906 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 28.
The spelling of 20351027080 in words is "twenty billion, three hundred fifty-one million, twenty-seven thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •