Base | Representation |
---|---|
bin | 10010100011111010… |
… | …001110011101010100 |
3 | 1220102221110200222010 |
4 | 102203322032131110 |
5 | 311304013201324 |
6 | 13053341104220 |
7 | 1303610444316 |
oct | 224372163524 |
9 | 56387420863 |
10 | 19929818964 |
11 | 84a7954a70 |
12 | 3a42558070 |
13 | 1b57ca48b3 |
14 | d70c577b6 |
15 | 7b9a06829 |
hex | 4a3e8e754 |
19929818964 has 288 divisors, whose sum is σ = 57044542464. Its totient is φ = 5351132160.
The previous prime is 19929818929. The next prime is 19929818969. The reversal of 19929818964 is 46981892991.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a junction number, because it is equal to n+sod(n) for n = 19929818895 and 19929818904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19929818969) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 122268747 + ... + 122268909.
It is an arithmetic number, because the mean of its divisors is an integer number (198071328).
Almost surely, 219929818964 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19929818964, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28522271232).
19929818964 is an abundant number, since it is smaller than the sum of its proper divisors (37114723500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19929818964 is a wasteful number, since it uses less digits than its factorization.
19929818964 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 347 (or 322 counting only the distinct ones).
The product of its digits is 20155392, while the sum is 66.
The spelling of 19929818964 in words is "nineteen billion, nine hundred twenty-nine million, eight hundred eighteen thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •