Base | Representation |
---|---|
bin | 11101011001001010011… |
… | …10100010101000000000 |
3 | 10120112211120211102121110 |
4 | 32230211032202220000 |
5 | 113021330110232032 |
6 | 2051543315323320 |
7 | 132652205236551 |
oct | 16544516425000 |
9 | 3515746742543 |
10 | 1009941883392 |
11 | 35a34a956052 |
12 | 1438975b0540 |
13 | 74310c18390 |
14 | 36c4a99c328 |
15 | 1b40e4947cc |
hex | eb253a2a00 |
1009941883392 has 640 divisors, whose sum is σ = 3223233699840. Its totient is φ = 278134456320.
The previous prime is 1009941883369. The next prime is 1009941883421. The reversal of 1009941883392 is 2933881499001.
It is a Harshad number since it is a multiple of its sum of digits (57).
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, 505728538 + ... + 505730534.
It is an arithmetic number, because the mean of its divisors is an integer number (5036302656).
Almost surely, 21009941883392 is an apocalyptic number.
1009941883392 is a gapful number since it is divisible by the number (12) 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 1009941883392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1611616849920).
1009941883392 is an abundant number, since it is smaller than the sum of its proper divisors (2213291816448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1009941883392 is a wasteful number, since it uses less digits than its factorization.
1009941883392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2124 (or 2108 counting only the distinct ones).
The product of its (nonzero) digits is 3359232, while the sum is 57.
The spelling of 1009941883392 in words is "one trillion, nine billion, nine hundred forty-one million, eight hundred eighty-three thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •