Base | Representation |
---|---|
bin | 100101111101… |
… | …1100010111100 |
3 | 1101110021010010 |
4 | 1023323202330 |
5 | 20043422300 |
6 | 1550343220 |
7 | 331121124 |
oct | 113734274 |
9 | 41407103 |
10 | 19904700 |
11 | 10265772 |
12 | 67bab10 |
13 | 417bc3a |
14 | 2901c84 |
15 | 1b32a50 |
hex | 12fb8bc |
19904700 has 72 divisors (see below), whose sum is σ = 58968448. Its totient is φ = 5181120.
The previous prime is 19904681. The next prime is 19904707. The reversal of 19904700 is 740991.
It is a hoax number, since the sum of its digits (30) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19904707) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12129 + ... + 13671.
Almost surely, 219904700 is an apocalyptic number.
19904700 is a gapful number since it is divisible by the number (10) 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 19904700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29484224).
19904700 is an abundant number, since it is smaller than the sum of its proper divisors (39063748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19904700 is a wasteful number, since it uses less digits than its factorization.
19904700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1603 (or 1596 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 30.
The square root of 19904700 is about 4461.4683681497. The cubic root of 19904700 is about 271.0099350488.
The spelling of 19904700 in words is "nineteen million, nine hundred four thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •