Base | Representation |
---|---|
bin | 10010010011100001… |
… | …101011011010010000 |
3 | 1212201210020211120102 |
4 | 102103201223122100 |
5 | 310223131322441 |
6 | 13010201431532 |
7 | 1264032206561 |
oct | 222341533220 |
9 | 55653224512 |
10 | 19654948496 |
11 | 8376784797 |
12 | 398649b5a8 |
13 | 1b13064c51 |
14 | d46546168 |
15 | 7a080d69b |
hex | 49386b690 |
19654948496 has 20 divisors (see below), whose sum is σ = 38190589500. Its totient is φ = 9799312512.
The previous prime is 19654948493. The next prime is 19654948499. The reversal of 19654948496 is 69484945691.
It is an interprime number because it is at equal distance from previous prime (19654948493) and next prime (19654948499).
It can be written as a sum of positive squares in 2 ways, for example, as 6310078096 + 13344870400 = 79436^2 + 115520^2 .
It is a Smith number, since the sum of its digits (65) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (19654948493) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1754351 + ... + 1765518.
It is an arithmetic number, because the mean of its divisors is an integer number (1909529475).
Almost surely, 219654948496 is an apocalyptic number.
19654948496 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
19654948496 is a deficient number, since it is larger than the sum of its proper divisors (18535641004).
19654948496 is a wasteful number, since it uses less digits than its factorization.
19654948496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3520226 (or 3520220 counting only the distinct ones).
The product of its digits is 67184640, while the sum is 65.
The spelling of 19654948496 in words is "nineteen billion, six hundred fifty-four million, nine hundred forty-eight thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •