Base | Representation |
---|---|
bin | 10010111010111010… |
… | …000100111001000110 |
3 | 1221102211111020112110 |
4 | 102322322010321012 |
5 | 313101301441000 |
6 | 13155523001450 |
7 | 1316304140025 |
oct | 227272047106 |
9 | 57384436473 |
10 | 20315655750 |
11 | 8685726945 |
12 | 3b2b809286 |
13 | 1bb9bc76a0 |
14 | daa1b28bc |
15 | 7dd81d850 |
hex | 4bae84e46 |
20315655750 has 128 divisors (see below), whose sum is σ = 55174025088. Its totient is φ = 4948992000.
The previous prime is 20315655743. The next prime is 20315655761. The reversal of 20315655750 is 5755651302.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 20315655699 and 20315655708.
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 63 ways as a sum of consecutive naturals, for example, 935010 + ... + 956490.
It is an arithmetic number, because the mean of its divisors is an integer number (431047071).
Almost surely, 220315655750 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20315655750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27587012544).
20315655750 is an abundant number, since it is smaller than the sum of its proper divisors (34858369338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20315655750 is a wasteful number, since it uses less digits than its factorization.
20315655750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21611 (or 21601 counting only the distinct ones).
The product of its (nonzero) digits is 157500, while the sum is 39.
The spelling of 20315655750 in words is "twenty billion, three hundred fifteen million, six hundred fifty-five thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •