Base | Representation |
---|---|
bin | 10000101111110000… |
… | …000011101000000000 |
3 | 1201102010102020120101 |
4 | 100233300003220000 |
5 | 243311113333341 |
6 | 12132123052144 |
7 | 1204404642100 |
oct | 205760035000 |
9 | 51363366511 |
10 | 17980996096 |
11 | 7697892558 |
12 | 3599971054 |
13 | 190730867b |
14 | c280c1200 |
15 | 7038a2831 |
hex | 42fc03a00 |
17980996096 has 120 divisors (see below), whose sum is σ = 42267311460. Its totient is φ = 7618609152.
The previous prime is 17980996093. The next prime is 17980996133. The reversal of 17980996096 is 69069908971.
It can be written as a sum of positive squares in 2 ways, for example, as 17973156096 + 7840000 = 134064^2 + 2800^2 .
It is a Harshad number since it is a multiple of its sum of digits (64).
It is not an unprimeable number, because it can be changed into a prime (17980996091) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2228806 + ... + 2236858.
Almost surely, 217980996096 is an apocalyptic number.
17980996096 is a gapful number since it is divisible by the number (16) 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 17980996096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21133655730).
17980996096 is an abundant number, since it is smaller than the sum of its proper divisors (24286315364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
17980996096 is an frugal number, since it uses more digits than its factorization.
17980996096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8174 (or 8151 counting only the distinct ones).
The product of its (nonzero) digits is 13226976, while the sum is 64.
The spelling of 17980996096 in words is "seventeen billion, nine hundred eighty million, nine hundred ninety-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •