Base | Representation |
---|---|
bin | 10010001000011010… |
… | …111111111101110000 |
3 | 1212020210200210202022 |
4 | 102020122333331300 |
5 | 304332433221204 |
6 | 12535504411012 |
7 | 1256310531410 |
oct | 221032777560 |
9 | 55223623668 |
10 | 19468648304 |
11 | 82905a9696 |
12 | 3934016a68 |
13 | 1ab3596551 |
14 | d298cc640 |
15 | 78e2ad5be |
hex | 4886bff70 |
19468648304 has 20 divisors (see below), whose sum is σ = 43109150064. Its totient is φ = 8343706368.
The previous prime is 19468648301. The next prime is 19468648307. The reversal of 19468648304 is 40384686491.
It is an interprime number because it is at equal distance from previous prime (19468648301) and next prime (19468648307).
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19468648301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 86913497 + ... + 86913720.
Almost surely, 219468648304 is an apocalyptic number.
19468648304 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
19468648304 is an abundant number, since it is smaller than the sum of its proper divisors (23640501760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19468648304 is a wasteful number, since it uses less digits than its factorization.
19468648304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173827232 (or 173827226 counting only the distinct ones).
The product of its (nonzero) digits is 3981312, while the sum is 53.
The spelling of 19468648304 in words is "nineteen billion, four hundred sixty-eight million, six hundred forty-eight thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •