Base | Representation |
---|---|
bin | 11101010010000101101… |
… | …10111100111101010100 |
3 | 10120012000220112110012200 |
4 | 32221002312330331110 |
5 | 112441040334031410 |
6 | 2050114410444500 |
7 | 132456121210200 |
oct | 16510266747524 |
9 | 3505026473180 |
10 | 1006144048980 |
11 | 3587810a3924 |
12 | 142bb7733730 |
13 | 73b5715b895 |
14 | 369aa431b00 |
15 | 1b28ad553c0 |
hex | ea42dbcf54 |
1006144048980 has 432 divisors, whose sum is σ = 3601188864000. Its totient is φ = 226686200832.
The previous prime is 1006144048961. The next prime is 1006144049023. The reversal of 1006144048980 is 898404416001.
1006144048980 is a `hidden beast` number, since 100 + 61 + 4 + 4 + 0 + 489 + 8 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 786663981 + ... + 786665259.
Almost surely, 21006144048980 is an apocalyptic number.
1006144048980 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 1006144048980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1800594432000).
1006144048980 is an abundant number, since it is smaller than the sum of its proper divisors (2595044815020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1006144048980 is a wasteful number, since it uses less digits than its factorization.
1006144048980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2516 (or 2504 counting only the distinct ones).
The product of its (nonzero) digits is 221184, while the sum is 45.
The spelling of 1006144048980 in words is "one trillion, six billion, one hundred forty-four million, forty-eight thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •