Base | Representation |
---|---|
bin | 11101010001111111010… |
… | …10100111110110000000 |
3 | 10120011220011202010102000 |
4 | 32220333222213312000 |
5 | 112440433131010440 |
6 | 2050105214424000 |
7 | 132454601010300 |
oct | 16507752476600 |
9 | 3504804663360 |
10 | 1006090485120 |
11 | 358753939576 |
12 | 142ba1802000 |
13 | 73b490262a6 |
14 | 369a328b600 |
15 | 1b2862c4730 |
hex | ea3faa7d80 |
1006090485120 has 1536 divisors, whose sum is σ = 4315094985600. Its totient is φ = 220723937280.
The previous prime is 1006090485091. The next prime is 1006090485151. The reversal of 1006090485120 is 215840906001.
1006090485120 is a `hidden beast` number, since 1 + 0 + 0 + 609 + 0 + 48 + 5 + 1 + 2 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 2534232762 + ... + 2534233158.
Almost surely, 21006090485120 is an apocalyptic number.
1006090485120 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 1006090485120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2157547492800).
1006090485120 is an abundant number, since it is smaller than the sum of its proper divisors (3309004500480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1006090485120 is a wasteful number, since it uses less digits than its factorization.
1006090485120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 553 (or 528 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The spelling of 1006090485120 in words is "one trillion, six billion, ninety million, four hundred eighty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •