Base | Representation |
---|---|
bin | 10000110000001001000… |
… | …000000100100110100000 |
3 | 11002001110021010112002210 |
4 | 100300021000010212200 |
5 | 122330130233432440 |
6 | 2240504403242120 |
7 | 146112602443530 |
oct | 20601100044640 |
9 | 4061407115083 |
10 | 1151202249120 |
11 | 404249726660 |
12 | 16713b379340 |
13 | 847339490c1 |
14 | 3da0b7514c0 |
15 | 1ee2ab77a80 |
hex | 10c090049a0 |
1151202249120 has 768 divisors, whose sum is σ = 4952179814400. Its totient is φ = 217372753920.
The previous prime is 1151202249017. The next prime is 1151202249163. The reversal of 1151202249120 is 219422021511.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 18189691 + ... + 18252869.
It is an arithmetic number, because the mean of its divisors is an integer number (6448150800).
Almost surely, 21151202249120 is an apocalyptic number.
1151202249120 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 1151202249120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2476089907200).
1151202249120 is an abundant number, since it is smaller than the sum of its proper divisors (3800977565280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1151202249120 is a wasteful number, since it uses less digits than its factorization.
1151202249120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63261 (or 63253 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 30.
The spelling of 1151202249120 in words is "one trillion, one hundred fifty-one billion, two hundred two million, two hundred forty-nine thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •