Base | Representation |
---|---|
bin | 10011011110101111… |
… | …001110000011110000 |
3 | 1222222201121222222222 |
4 | 103132233032003300 |
5 | 320314144230423 |
6 | 13335315220212 |
7 | 1340223530360 |
oct | 233657160360 |
9 | 58881558888 |
10 | 20916789488 |
11 | 8963a89591 |
12 | 4078ba7668 |
13 | 1c845cc31a |
14 | 1025d729a0 |
15 | 8264b23c8 |
hex | 4debce0f0 |
20916789488 has 20 divisors (see below), whose sum is σ = 46315748400. Its totient is φ = 8964338304.
The previous prime is 20916789451. The next prime is 20916789539. The reversal of 20916789488 is 88498761902.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 20916789488.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 93378413 + ... + 93378636.
It is an arithmetic number, because the mean of its divisors is an integer number (2315787420).
Almost surely, 220916789488 is an apocalyptic number.
20916789488 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
20916789488 is an abundant number, since it is smaller than the sum of its proper divisors (25398958912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20916789488 is a wasteful number, since it uses less digits than its factorization.
20916789488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186757064 (or 186757058 counting only the distinct ones).
The product of its (nonzero) digits is 13934592, while the sum is 62.
The spelling of 20916789488 in words is "twenty billion, nine hundred sixteen million, seven hundred eighty-nine thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •