Base | Representation |
---|---|
bin | 1011111101000101… |
… | …1000100000011000 |
3 | 22021122022100102000 |
4 | 2333101120200120 |
5 | 23033001130310 |
6 | 1250232041000 |
7 | 142344043641 |
oct | 27721304030 |
9 | 8248270360 |
10 | 3209005080 |
11 | 13a7444016 |
12 | 756833160 |
13 | 3c1aa2598 |
14 | 2262906c8 |
15 | 13bacb4c0 |
hex | bf458818 |
3209005080 has 128 divisors (see below), whose sum is σ = 11161843200. Its totient is φ = 818522496.
The previous prime is 3209005073. The next prime is 3209005087. The reversal of 3209005080 is 805009023.
It is an interprime number because it is at equal distance from previous prime (3209005073) and next prime (3209005087).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3209005087) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39754 + ... + 89433.
It is an arithmetic number, because the mean of its divisors is an integer number (87201900).
Almost surely, 23209005080 is an apocalyptic number.
3209005080 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3209005080 is an abundant number, since it is smaller than the sum of its proper divisors (7952838120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3209005080 is a wasteful number, since it uses less digits than its factorization.
3209005080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129230 (or 129220 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 3209005080 is about 56648.0809913275. The cubic root of 3209005080 is about 1474.9935964483.
The spelling of 3209005080 in words is "three billion, two hundred nine million, five thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •