Base | Representation |
---|---|
bin | 100110000100… |
… | …1000011000000 |
3 | 1101120001222021 |
4 | 1030021003000 |
5 | 20102210000 |
6 | 1551451224 |
7 | 331441264 |
oct | 114110300 |
9 | 41501867 |
10 | 19960000 |
11 | 102a3275 |
12 | 6826b14 |
13 | 419b168 |
14 | 29180a4 |
15 | 1b4411a |
hex | 13090c0 |
19960000 has 70 divisors (see below), whose sum is σ = 49593500. Its totient is φ = 7968000.
The previous prime is 19959977. The next prime is 19960009. The reversal of 19960000 is 6991.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (19960009) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 39751 + ... + 40249.
Almost surely, 219960000 is an apocalyptic number.
19960000 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 19960000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24796750).
19960000 is an abundant number, since it is smaller than the sum of its proper divisors (29633500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19960000 is an frugal number, since it uses more digits than its factorization.
19960000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531 (or 506 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 25.
The square root of 19960000 is about 4467.6615807377. The cubic root of 19960000 is about 271.2606797100.
Adding to 19960000 its reverse (6991), we get a palindrome (19966991).
The spelling of 19960000 in words is "nineteen million, nine hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •