Base | Representation |
---|---|
bin | 10001011000000010… |
… | …101111011110110000 |
3 | 1210011020101221012220 |
4 | 101120002233132300 |
5 | 301202141423320 |
6 | 12323151521040 |
7 | 1230223511220 |
oct | 213002573660 |
9 | 53136357186 |
10 | 18656982960 |
11 | 7a04420490 |
12 | 3748229180 |
13 | 19b438aab5 |
14 | c8dba8080 |
15 | 742dcee40 |
hex | 4580af7b0 |
18656982960 has 640 divisors, whose sum is σ = 77069352960. Its totient is φ = 3619123200.
The previous prime is 18656982943. The next prime is 18656982983. The reversal of 18656982960 is 6928965681.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a junction number, because it is equal to n+sod(n) for n = 18656982894 and 18656982903.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 16612959 + ... + 16614081.
It is an arithmetic number, because the mean of its divisors is an integer number (120420864).
Almost surely, 218656982960 is an apocalyptic number.
18656982960 is a gapful number since it is divisible by the number (10) 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 18656982960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38534676480).
18656982960 is an abundant number, since it is smaller than the sum of its proper divisors (58412370000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18656982960 is a wasteful number, since it uses less digits than its factorization.
18656982960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1217 (or 1211 counting only the distinct ones).
The product of its (nonzero) digits is 11197440, while the sum is 60.
The spelling of 18656982960 in words is "eighteen billion, six hundred fifty-six million, nine hundred eighty-two thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •