Base | Representation |
---|---|
bin | 10010101000001011… |
… | …111100001101110100 |
3 | 1220121221111010012212 |
4 | 102220023330031310 |
5 | 311430400243300 |
6 | 13104423032552 |
7 | 1305441361055 |
oct | 225013741564 |
9 | 56557433185 |
10 | 20001571700 |
11 | 8534402950 |
12 | 3a6259b758 |
13 | 1b69b08136 |
14 | d7a5b472c |
15 | 7c0e7b935 |
hex | 4a82fc374 |
20001571700 has 144 divisors (see below), whose sum is σ = 49952427840. Its totient is φ = 6875136000.
The previous prime is 20001571693. The next prime is 20001571717. The reversal of 20001571700 is 717510002.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
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, 13396154 + ... + 13397646.
It is an arithmetic number, because the mean of its divisors is an integer number (346891860).
Almost surely, 220001571700 is an apocalyptic number.
20001571700 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 20001571700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24976213920).
20001571700 is an abundant number, since it is smaller than the sum of its proper divisors (29950856140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001571700 is a wasteful number, since it uses less digits than its factorization.
20001571700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2178 (or 2171 counting only the distinct ones).
The product of its (nonzero) digits is 490, while the sum is 23.
The spelling of 20001571700 in words is "twenty billion, one million, five hundred seventy-one thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •