Base | Representation |
---|---|
bin | 10100110000011000110… |
… | …001010011011010000000 |
3 | 12001100122102020020100020 |
4 | 110300120301103122000 |
5 | 141332123222020000 |
6 | 3011130445253440 |
7 | 205023103035624 |
oct | 24603061233200 |
9 | 5040572206306 |
10 | 1426344720000 |
11 | 4aaa00456362 |
12 | 1b0527b64280 |
13 | a46719053a5 |
14 | 4d06d3d5184 |
15 | 27180e07ba0 |
hex | 14c18c53680 |
1426344720000 has 640 divisors, whose sum is σ = 4992321945600. Its totient is φ = 360168960000.
The previous prime is 1426344719999. The next prime is 1426344720019. The reversal of 1426344720000 is 274436241.
It is a tau number, because it is divible by the number of its divisors (640).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 349677961 + ... + 349682039.
It is an arithmetic number, because the mean of its divisors is an integer number (7800503040).
Almost surely, 21426344720000 is an apocalyptic number.
1426344720000 is a gapful number since it is divisible by the number (10) 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 1426344720000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2496160972800).
1426344720000 is an abundant number, since it is smaller than the sum of its proper divisors (3565977225600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1426344720000 is an equidigital number, since it uses as much as digits as its factorization.
1426344720000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4194 (or 4167 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 33.
The spelling of 1426344720000 in words is "one trillion, four hundred twenty-six billion, three hundred forty-four million, seven hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •