Base | Representation |
---|---|
bin | 1001101110000011… |
… | …0011111010101100 |
3 | 20201211102110211121 |
4 | 2123200303322230 |
5 | 20320410212430 |
6 | 1110521230324 |
7 | 121440504214 |
oct | 23340637254 |
9 | 6654373747 |
10 | 2609069740 |
11 | 111982a792 |
12 | 6099323a4 |
13 | 3276ca264 |
14 | 1aa723244 |
15 | 1040c2a7a |
hex | 9b833eac |
2609069740 has 72 divisors (see below), whose sum is σ = 5969642112. Its totient is φ = 956724480.
The previous prime is 2609069663. The next prime is 2609069761. The reversal of 2609069740 is 479609062.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 217992 + ... + 229648.
It is an arithmetic number, because the mean of its divisors is an integer number (82911696).
Almost surely, 22609069740 is an apocalyptic number.
2609069740 is a gapful number since it is divisible by the number (20) 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 2609069740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2984821056).
2609069740 is an abundant number, since it is smaller than the sum of its proper divisors (3360572372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2609069740 is a wasteful number, since it uses less digits than its factorization.
2609069740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11735 (or 11714 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 43.
The square root of 2609069740 is about 51079.0538283551. The cubic root of 2609069740 is about 1376.6659239235.
The spelling of 2609069740 in words is "two billion, six hundred nine million, sixty-nine thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •