Base | Representation |
---|---|
bin | 11110010010111000101… |
… | …00111010100000000000 |
3 | 10200111211021110022122200 |
4 | 33021130110322200000 |
5 | 114023311323301000 |
6 | 2114110325233200 |
7 | 135130146060321 |
oct | 17113424724000 |
9 | 3614737408580 |
10 | 1040931072000 |
11 | 3715024a9126 |
12 | 1498a5862800 |
13 | 7720c203681 |
14 | 3854a53c448 |
15 | 1c124d66500 |
hex | f25c53a800 |
1040931072000 has 288 divisors, whose sum is σ = 3751995560040. Its totient is φ = 277581004800.
The previous prime is 1040931071977. The next prime is 1040931072017. The reversal of 1040931072000 is 2701390401.
It can be written as a sum of positive squares in 4 ways, for example, as 167169770496 + 873761301504 = 408864^2 + 934752^2 .
It is a tau number, because it is divible by the number of its divisors (288).
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, 2078104 + ... + 2529896.
Almost surely, 21040931072000 is an apocalyptic number.
1040931072000 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 1040931072000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1875997780020).
1040931072000 is an abundant number, since it is smaller than the sum of its proper divisors (2711064488040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040931072000 is an equidigital number, since it uses as much as digits as its factorization.
1040931072000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 451836 (or 451803 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The spelling of 1040931072000 in words is "one trillion, forty billion, nine hundred thirty-one million, seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •