Base | Representation |
---|---|
bin | 100011000100010010110… |
… | …010111101000000000000 |
3 | 22112101002112210100201120 |
4 | 203010102302331000000 |
5 | 303440223223000000 |
6 | 5043013153432240 |
7 | 336046615014030 |
oct | 43042262750000 |
9 | 8471075710646 |
10 | 2409792000000 |
11 | 849a94840770 |
12 | 32b04a56b680 |
13 | 14631c764448 |
14 | 848c530d8c0 |
15 | 42a3e3996a0 |
hex | 23112cbd000 |
2409792000000 has 1456 divisors, whose sum is σ = 10074801040896. Its totient is φ = 497664000000.
The previous prime is 2409791999971. The next prime is 2409792000019. The reversal of 2409792000000 is 2979042.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 14783999919 + ... + 14784000081.
Almost surely, 22409792000000 is an apocalyptic number.
2409792000000 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 2409792000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5037400520448).
2409792000000 is an abundant number, since it is smaller than the sum of its proper divisors (7665009040896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2409792000000 is an frugal number, since it uses more digits than its factorization.
2409792000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238 (or 191 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
Adding to 2409792000000 its reverse (2979042), we get a palindrome (2409794979042).
The spelling of 2409792000000 in words is "two trillion, four hundred nine billion, seven hundred ninety-two million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •