Base | Representation |
---|---|
bin | 10001111100110111… |
… | …010001101000000000 |
3 | 1211202021210221110000 |
4 | 101330313101220000 |
5 | 303433312442310 |
6 | 12504340240000 |
7 | 1251434352000 |
oct | 217467215000 |
9 | 54667727400 |
10 | 19274734080 |
11 | 81a10a2aa8 |
12 | 389b0a0000 |
13 | 1a823602c4 |
14 | d0bc52000 |
15 | 77c2574c0 |
hex | 47cdd1a00 |
19274734080 has 800 divisors, whose sum is σ = 80805542400. Its totient is φ = 4389396480.
The previous prime is 19274734033. The next prime is 19274734111. The reversal of 19274734080 is 8043747291.
19274734080 is a `hidden beast` number, since 192 + 7 + 47 + 340 + 80 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 71124345 + ... + 71124615.
It is an arithmetic number, because the mean of its divisors is an integer number (101006928).
Almost surely, 219274734080 is an apocalyptic number.
19274734080 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 19274734080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40402771200).
19274734080 is an abundant number, since it is smaller than the sum of its proper divisors (61530808320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19274734080 is an frugal number, since it uses more digits than its factorization.
19274734080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327 (or 288 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 45.
The spelling of 19274734080 in words is "nineteen billion, two hundred seventy-four million, seven hundred thirty-four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •