Base | Representation |
---|---|
bin | 10010000110001010… |
… | …010010001011000000 |
3 | 1212011011022102221000 |
4 | 102012022102023000 |
5 | 304243230241000 |
6 | 12532031332000 |
7 | 1255340220060 |
oct | 220612221300 |
9 | 55134272830 |
10 | 19430712000 |
11 | 8271148577 |
12 | 3923381000 |
13 | 1aa877312b |
14 | d248553a0 |
15 | 78acb8000 |
hex | 4862922c0 |
19430712000 has 896 divisors, whose sum is σ = 83077263360. Its totient is φ = 4354560000.
The previous prime is 19430711981. The next prime is 19430712011. The reversal of 19430712000 is 21703491.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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 127 ways as a sum of consecutive naturals, for example, 107351910 + ... + 107352090.
It is an arithmetic number, because the mean of its divisors is an integer number (92720160).
Almost surely, 219430712000 is an apocalyptic number.
19430712000 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 19430712000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41538631680).
19430712000 is an abundant number, since it is smaller than the sum of its proper divisors (63646551360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19430712000 is a wasteful number, since it uses less digits than its factorization.
19430712000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295 (or 269 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The spelling of 19430712000 in words is "nineteen billion, four hundred thirty million, seven hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •