Base | Representation |
---|---|
bin | 10010001001111000… |
… | …111111111010111100 |
3 | 1212022112001201100010 |
4 | 102021320333322330 |
5 | 304410240232120 |
6 | 12542144503220 |
7 | 1260030141165 |
oct | 221170777274 |
9 | 55275051303 |
10 | 19493289660 |
11 | 82a34aa049 |
12 | 394031ab10 |
13 | 1ab8713430 |
14 | d2cca476c |
15 | 7915297e0 |
hex | 489e3febc |
19493289660 has 192 divisors, whose sum is σ = 59960194560. Its totient is φ = 4702510080.
The previous prime is 19493289643. The next prime is 19493289671. The reversal of 19493289660 is 6698239491.
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 19493289660.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 28209915 + ... + 28210605.
It is an arithmetic number, because the mean of its divisors is an integer number (312292680).
Almost surely, 219493289660 is an apocalyptic number.
19493289660 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 19493289660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29980097280).
19493289660 is an abundant number, since it is smaller than the sum of its proper divisors (40466904900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19493289660 is a wasteful number, since it uses less digits than its factorization.
19493289660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1388 (or 1386 counting only the distinct ones).
The product of its (nonzero) digits is 5038848, while the sum is 57.
The spelling of 19493289660 in words is "nineteen billion, four hundred ninety-three million, two hundred eighty-nine thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •