Base | Representation |
---|---|
bin | 100100001100… |
… | …1010001000000 |
3 | 1022201011201120 |
4 | 1020121101000 |
5 | 14324242411 |
6 | 1514432240 |
7 | 320211012 |
oct | 110312100 |
9 | 38634646 |
10 | 18977856 |
11 | a792387 |
12 | 6432680 |
13 | 3c16101 |
14 | 27401b2 |
15 | 19ed106 |
hex | 1219440 |
18977856 has 56 divisors (see below), whose sum is σ = 50779680. Its totient is φ = 6254592.
The previous prime is 18977843. The next prime is 18977863. The reversal of 18977856 is 65877981.
It is a junction number, because it is equal to n+sod(n) for n = 18977799 and 18977808.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18115 + ... + 19133.
It is an arithmetic number, because the mean of its divisors is an integer number (906780).
Almost surely, 218977856 is an apocalyptic number.
18977856 is a gapful number since it is divisible by the number (16) 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 18977856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25389840).
18977856 is an abundant number, since it is smaller than the sum of its proper divisors (31801824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18977856 is a wasteful number, since it uses less digits than its factorization.
18977856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1131 (or 1121 counting only the distinct ones).
The product of its digits is 846720, while the sum is 51.
The square root of 18977856 is about 4356.3581120014. The cubic root of 18977856 is about 266.7364595098.
The spelling of 18977856 in words is "eighteen million, nine hundred seventy-seven thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •