Base | Representation |
---|---|
bin | 10010010100010001… |
… | …001110010100010000 |
3 | 1212202122201001121120 |
4 | 102110101032110100 |
5 | 310234324142430 |
6 | 13011324522240 |
7 | 1264243150200 |
oct | 222421162420 |
9 | 55678631546 |
10 | 19667412240 |
11 | 8382817a03 |
12 | 398a6b0380 |
13 | 1b1580a048 |
14 | d4806c400 |
15 | 7a1971610 |
hex | 49444e510 |
19667412240 has 960 divisors, whose sum is σ = 80609126400. Its totient is φ = 3934199808.
The previous prime is 19667412211. The next prime is 19667412277. The reversal of 19667412240 is 4221476691.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 19667412192 and 19667412201.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 220982116 + ... + 220982204.
It is an arithmetic number, because the mean of its divisors is an integer number (83967840).
Almost surely, 219667412240 is an apocalyptic number.
19667412240 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 19667412240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40304563200).
19667412240 is an abundant number, since it is smaller than the sum of its proper divisors (60941714160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19667412240 is a wasteful number, since it uses less digits than its factorization.
19667412240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204 (or 191 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 42.
The spelling of 19667412240 in words is "nineteen billion, six hundred sixty-seven million, four hundred twelve thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •