Base | Representation |
---|---|
bin | 10001000110110111… |
… | …000110001000010000 |
3 | 1202102010222112010000 |
4 | 101012313012020100 |
5 | 300104342423303 |
6 | 12234413210000 |
7 | 1220123343513 |
oct | 210667061020 |
9 | 52363875100 |
10 | 18368717328 |
11 | 7876731225 |
12 | 3687790900 |
13 | 196973b110 |
14 | c637aad7a |
15 | 72793cda3 |
hex | 446dc6210 |
18368717328 has 400 divisors, whose sum is σ = 61706050560. Its totient is φ = 5224476672.
The previous prime is 18368717321. The next prime is 18368717329. The reversal of 18368717328 is 82371786381.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (18368717321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 16898001 + ... + 16899087.
Almost surely, 218368717328 is an apocalyptic number.
18368717328 is a gapful number since it is divisible by the number (18) 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 18368717328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30853025280).
18368717328 is an abundant number, since it is smaller than the sum of its proper divisors (43337333232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18368717328 is a wasteful number, since it uses less digits than its factorization.
18368717328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1196 (or 1181 counting only the distinct ones).
The product of its digits is 2709504, while the sum is 54.
The spelling of 18368717328 in words is "eighteen billion, three hundred sixty-eight million, seven hundred seventeen thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •