Base | Representation |
---|---|
bin | 10001001010011011… |
… | …100011010001000000 |
3 | 1202120022200011020121 |
4 | 101022123203101000 |
5 | 300220210334004 |
6 | 12244352550024 |
7 | 1221451363561 |
oct | 211233432100 |
9 | 52508604217 |
10 | 18428605504 |
11 | 78a7516091 |
12 | 36a3852314 |
13 | 1978c791ca |
14 | c6b71a168 |
15 | 72cd1c854 |
hex | 44a6e3440 |
18428605504 has 63 divisors (see below), whose sum is σ = 37247422711. Its totient is φ = 9046513280.
The previous prime is 18428605501. The next prime is 18428605511. The reversal of 18428605504 is 40550682481.
The square root of 18428605504 is 135752.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×184286055042 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (18428605501) 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 8 ways as a sum of consecutive naturals, for example, 77107017 + ... + 77107255.
Almost surely, 218428605504 is an apocalyptic number.
18428605504 is the 135752-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 18428605504
18428605504 is an abundant number, since it is smaller than the sum of its proper divisors (18818817207).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18428605504 is an frugal number, since it uses more digits than its factorization.
18428605504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632 (or 312 counting only the distinct ones).
The product of its (nonzero) digits is 307200, while the sum is 43.
The spelling of 18428605504 in words is "eighteen billion, four hundred twenty-eight million, six hundred five thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •