Base | Representation |
---|---|
bin | 1000011110011010011000… |
… | …11011100111110101101100 |
3 | 2102222200201201002220000100 |
4 | 10033031030123213311230 |
5 | 4420322333211004303 |
6 | 103345441510231100 |
7 | 3632326560066354 |
oct | 417151433476554 |
9 | 72880651086010 |
10 | 18637145406828 |
11 | 5a35a72792783 |
12 | 2110006355490 |
13 | a52624229240 |
14 | 486085067b64 |
15 | 224bdccdc8a3 |
hex | 10f34c6e7d6c |
18637145406828 has 36 divisors (see below), whose sum is σ = 50734451386528. Its totient is φ = 5734506278880.
The previous prime is 18637145406809. The next prime is 18637145406853. The reversal of 18637145406828 is 82860454173681.
18637145406828 is a `hidden beast` number, since 1 + 8 + 6 + 3 + 7 + 1 + 4 + 540 + 6 + 82 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19911479668 + ... + 19911480603.
Almost surely, 218637145406828 is an apocalyptic number.
18637145406828 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
18637145406828 is an abundant number, since it is smaller than the sum of its proper divisors (32097305979700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18637145406828 is a wasteful number, since it uses less digits than its factorization.
18637145406828 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39822960294 (or 39822960289 counting only the distinct ones).
The product of its (nonzero) digits is 61931520, while the sum is 63.
The spelling of 18637145406828 in words is "eighteen trillion, six hundred thirty-seven billion, one hundred forty-five million, four hundred six thousand, eight hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •