Base | Representation |
---|---|
bin | 10010111111011111… |
… | …101001000000000000 |
3 | 1221122012022000110000 |
4 | 102333133221000000 |
5 | 313231002034330 |
6 | 13211312240000 |
7 | 1321230224556 |
oct | 227737510000 |
9 | 57565260400 |
10 | 20392611840 |
11 | 8715109117 |
12 | 3b51540000 |
13 | 1bccb30433 |
14 | db64c5bd6 |
15 | 7e5470560 |
hex | 4bf7e9000 |
20392611840 has 520 divisors, whose sum is σ = 77068791360. Its totient is φ = 5143855104.
The previous prime is 20392611829. The next prime is 20392611887. The reversal of 20392611840 is 4811629302.
20392611840 is a `hidden beast` number, since 2 + 0 + 39 + 2 + 611 + 8 + 4 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 20392611795 and 20392611804.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 31518397 + ... + 31519043.
Almost surely, 220392611840 is an apocalyptic number.
20392611840 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 20392611840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38534395680).
20392611840 is an abundant number, since it is smaller than the sum of its proper divisors (56676179520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20392611840 is an equidigital number, since it uses as much as digits as its factorization.
20392611840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 707 (or 676 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The spelling of 20392611840 in words is "twenty billion, three hundred ninety-two million, six hundred eleven thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •