Base | Representation |
---|---|
bin | 10010010011111000… |
… | …101000010000000101 |
3 | 1212202012120111111001 |
4 | 102103320220100011 |
5 | 310231201333434 |
6 | 13010534413301 |
7 | 1264134305200 |
oct | 222370502005 |
9 | 55665514431 |
10 | 19660964869 |
11 | 837a1139a7 |
12 | 3988501231 |
13 | 1b14390530 |
14 | d47270937 |
15 | 7a10eb114 |
hex | 493e28405 |
19660964869 has 24 divisors (see below), whose sum is σ = 24824260608. Its totient is φ = 15433377120.
The previous prime is 19660964849. The next prime is 19660964893. The reversal of 19660964869 is 96846906691.
It is not a de Polignac number, because 19660964869 - 213 = 19660956677 is a prime.
It is a super-2 number, since 2×196609648692 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 19660964869.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19660964849) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40617 + ... + 202414.
It is an arithmetic number, because the mean of its divisors is an integer number (1034344192).
Almost surely, 219660964869 is an apocalyptic number.
It is an amenable number.
19660964869 is a deficient number, since it is larger than the sum of its proper divisors (5163295739).
19660964869 is a wasteful number, since it uses less digits than its factorization.
19660964869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243185 (or 243178 counting only the distinct ones).
The product of its (nonzero) digits is 30233088, while the sum is 64.
The spelling of 19660964869 in words is "nineteen billion, six hundred sixty million, nine hundred sixty-four thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •