Base | Representation |
---|---|
bin | 10010100101011100… |
… | …110000101101010000 |
3 | 1220111202002000121110 |
4 | 102211130300231100 |
5 | 311332121234420 |
6 | 13100102453320 |
7 | 1304343135513 |
oct | 224534605520 |
9 | 56452060543 |
10 | 19955649360 |
11 | 85104977a9 |
12 | 3a4b134240 |
13 | 1b60449a5a |
14 | d7445cd7a |
15 | 7bbe09ee0 |
hex | 4a5730b50 |
19955649360 has 160 divisors (see below), whose sum is σ = 64120896000. Its totient is φ = 5127958528.
The previous prime is 19955649349. The next prime is 19955649377. The reversal of 19955649360 is 6394655991.
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 19955649360.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3957721 + ... + 3962759.
It is an arithmetic number, because the mean of its divisors is an integer number (400755600).
Almost surely, 219955649360 is an apocalyptic number.
19955649360 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 19955649360, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32060448000).
19955649360 is an abundant number, since it is smaller than the sum of its proper divisors (44165246640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19955649360 is a wasteful number, since it uses less digits than its factorization.
19955649360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5653 (or 5647 counting only the distinct ones).
The product of its (nonzero) digits is 7873200, while the sum is 57.
The spelling of 19955649360 in words is "nineteen billion, nine hundred fifty-five million, six hundred forty-nine thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •