Base | Representation |
---|---|
bin | 100011111000… |
… | …1000000101010 |
3 | 1022101210112200 |
4 | 1013301000222 |
5 | 14304003340 |
6 | 1511121030 |
7 | 315623211 |
oct | 107610052 |
9 | 38353480 |
10 | 18812970 |
11 | a68a510 |
12 | 6373176 |
13 | 3b89047 |
14 | 26da078 |
15 | 19b9330 |
hex | 11f102a |
18812970 has 96 divisors (see below), whose sum is σ = 55171584. Its totient is φ = 4406400.
The previous prime is 18812953. The next prime is 18812987. The reversal of 18812970 is 7921881.
It is an interprime number because it is at equal distance from previous prime (18812953) and next prime (18812987).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 30384 + ... + 30996.
It is an arithmetic number, because the mean of its divisors is an integer number (574704).
Almost surely, 218812970 is an apocalyptic number.
18812970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 18812970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27585792).
18812970 is an abundant number, since it is smaller than the sum of its proper divisors (36358614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18812970 is a wasteful number, since it uses less digits than its factorization.
18812970 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 668 (or 665 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 36.
The square root of 18812970 is about 4337.3920735852. The cubic root of 18812970 is about 265.9617126946.
It can be divided in two parts, 1881 and 2970, that added together give a triangular number (4851 = T98).
The spelling of 18812970 in words is "eighteen million, eight hundred twelve thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.249 sec. • engine limits •