Base | Representation |
---|---|
bin | 100001100110101101110… |
… | …000011111110101100000 |
3 | 22011202201222002110112001 |
4 | 201212231300133311200 |
5 | 300313433012002012 |
6 | 4524514503413344 |
7 | 325561630210000 |
oct | 41465560376540 |
9 | 8152658073461 |
10 | 2309312609632 |
11 | 810412845586 |
12 | 313688154254 |
13 | 1399c8837682 |
14 | 7dab2740000 |
15 | 4010d018357 |
hex | 219adc1fd60 |
2309312609632 has 120 divisors (see below), whose sum is σ = 5583042271800. Its totient is φ = 937615053312.
The previous prime is 2309312609609. The next prime is 2309312609647. The reversal of 2309312609632 is 2369062139032.
2309312609632 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 668844 + ... + 2250772.
It is an arithmetic number, because the mean of its divisors is an integer number (46525352265).
Almost surely, 22309312609632 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2309312609632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2791521135900).
2309312609632 is an abundant number, since it is smaller than the sum of its proper divisors (3273729662168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2309312609632 is an equidigital number, since it uses as much as digits as its factorization.
2309312609632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1581986 (or 1581957 counting only the distinct ones).
The product of its (nonzero) digits is 629856, while the sum is 46.
The spelling of 2309312609632 in words is "two trillion, three hundred nine billion, three hundred twelve million, six hundred nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •