Base | Representation |
---|---|
bin | 10011001111001101111101… |
… | …11111111010000100000000 |
3 | 12112210020220000010200121010 |
4 | 21213212332333322010000 |
5 | 21021103240323302430 |
6 | 225550202210200520 |
7 | 11624246626103460 |
oct | 1147467677720400 |
9 | 175706800120533 |
10 | 42304337322240 |
11 | 12530194601594 |
12 | 48b2a44b83140 |
13 | 1a7b3884169a6 |
14 | a6378014bba0 |
15 | 4d5676060cb0 |
hex | 2679beffa100 |
42304337322240 has 576 divisors, whose sum is σ = 163745349659136. Its totient is φ = 9086764056576.
The previous prime is 42304337322209. The next prime is 42304337322263. The reversal of 42304337322240 is 4222373340324.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 298323994 + ... + 298465766.
It is an arithmetic number, because the mean of its divisors is an integer number (284280120936).
Almost surely, 242304337322240 is an apocalyptic number.
42304337322240 is a gapful number since it is divisible by the number (40) 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 42304337322240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81872674829568).
42304337322240 is an abundant number, since it is smaller than the sum of its proper divisors (121441012336896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42304337322240 is a wasteful number, since it uses less digits than its factorization.
42304337322240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142474 (or 142460 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 39.
The spelling of 42304337322240 in words is "forty-two trillion, three hundred four billion, three hundred thirty-seven million, three hundred twenty-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •