Base | Representation |
---|---|
bin | 100011010111001001111… |
… | …110110001111010000000 |
3 | 22121022101000202112002002 |
4 | 203113021332301322000 |
5 | 304303213032400000 |
6 | 5100203010043132 |
7 | 340364533251245 |
oct | 43271176617200 |
9 | 8538330675062 |
10 | 2430045200000 |
11 | 857638189690 |
12 | 332b612794a8 |
13 | 1481c9732162 |
14 | 858870a55cc |
15 | 4332747c8d5 |
hex | 235c9fb1e80 |
2430045200000 has 192 divisors, whose sum is σ = 6601097190240. Its totient is φ = 883651200000.
The previous prime is 2430045199999. The next prime is 2430045200057. The reversal of 2430045200000 is 25400342.
2430045200000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4123859 + ... + 4676141.
Almost surely, 22430045200000 is an apocalyptic number.
2430045200000 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 2430045200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3300548595120).
2430045200000 is an abundant number, since it is smaller than the sum of its proper divisors (4171051990240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2430045200000 is an frugal number, since it uses more digits than its factorization.
2430045200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552333 (or 552301 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 20.
The spelling of 2430045200000 in words is "two trillion, four hundred thirty billion, forty-five million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •