Base | Representation |
---|---|
bin | 100101101000… |
… | …1000010101000 |
3 | 1101010102021222 |
4 | 1023101002220 |
5 | 20022334400 |
6 | 1542521212 |
7 | 326464421 |
oct | 113210250 |
9 | 41112258 |
10 | 19730600 |
11 | 1015698a |
12 | 6736208 |
13 | 411a916 |
14 | 2898648 |
15 | 1aeb185 |
hex | 12d10a8 |
19730600 has 48 divisors (see below), whose sum is σ = 46872000. Its totient is φ = 7720640.
The previous prime is 19730597. The next prime is 19730609. The reversal of 19730600 is 603791.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 19730600.
It is not an unprimeable number, because it can be changed into a prime (19730609) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8351 + ... + 10449.
It is an arithmetic number, because the mean of its divisors is an integer number (976500).
Almost surely, 219730600 is an apocalyptic number.
19730600 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 19730600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23436000).
19730600 is an abundant number, since it is smaller than the sum of its proper divisors (27141400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19730600 is a wasteful number, since it uses less digits than its factorization.
19730600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2162 (or 2153 counting only the distinct ones).
The product of its (nonzero) digits is 1134, while the sum is 26.
The square root of 19730600 is about 4441.9140018690. The cubic root of 19730600 is about 270.2174745342.
The spelling of 19730600 in words is "nineteen million, seven hundred thirty thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •