Base | Representation |
---|---|
bin | 100100110110… |
… | …0111110000000 |
3 | 1100100121000122 |
4 | 1021230332000 |
5 | 14421230304 |
6 | 1530035412 |
7 | 323136404 |
oct | 111547600 |
9 | 40317018 |
10 | 19320704 |
11 | a9a6a27 |
12 | 6578b68 |
13 | 4006190 |
14 | 27cd104 |
15 | 1a699be |
hex | 126cf80 |
19320704 has 64 divisors (see below), whose sum is σ = 43953840. Its totient is φ = 8380416.
The previous prime is 19320683. The next prime is 19320709. The reversal of 19320704 is 40702391.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19320709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27947 + ... + 28629.
Almost surely, 219320704 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19320704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21976920).
19320704 is an abundant number, since it is smaller than the sum of its proper divisors (24633136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19320704 is a wasteful number, since it uses less digits than its factorization.
19320704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 727 (or 715 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 26.
The square root of 19320704 is about 4395.5322772106. The cubic root of 19320704 is about 268.3331418111. Note that the first 3 decimals are identical.
The spelling of 19320704 in words is "nineteen million, three hundred twenty thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •