Base | Representation |
---|---|
bin | 10010010000100110… |
… | …110011001011010100 |
3 | 1212121101001221010201 |
4 | 102100212303023110 |
5 | 310123111200010 |
6 | 13001251430244 |
7 | 1262565622300 |
oct | 222046631324 |
9 | 55541057121 |
10 | 19605959380 |
11 | 8351064517 |
12 | 3971bb5384 |
13 | 1b05b719c7 |
14 | d3dc32d00 |
15 | 79b38323a |
hex | 4909b32d4 |
19605959380 has 72 divisors (see below), whose sum is σ = 48216357000. Its totient is φ = 6676879104.
The previous prime is 19605959357. The next prime is 19605959491. The reversal of 19605959380 is 8395950691.
It can be written as a sum of positive squares in 4 ways, for example, as 2427138756 + 17178820624 = 49266^2 + 131068^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 78886 + ... + 213154.
It is an arithmetic number, because the mean of its divisors is an integer number (669671625).
Almost surely, 219605959380 is an apocalyptic number.
19605959380 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 19605959380, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24108178500).
19605959380 is an abundant number, since it is smaller than the sum of its proper divisors (28610397620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19605959380 is a wasteful number, since it uses less digits than its factorization.
19605959380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134441 (or 134432 counting only the distinct ones).
The product of its (nonzero) digits is 2624400, while the sum is 55.
The spelling of 19605959380 in words is "nineteen billion, six hundred five million, nine hundred fifty-nine thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •