Base | Representation |
---|---|
bin | 10000111001100011010… |
… | …001100100011100000000 |
3 | 11010000112110110211100000 |
4 | 100321203101210130000 |
5 | 123011324010020000 |
6 | 2245255201200000 |
7 | 146621156151360 |
oct | 20714321443400 |
9 | 4100473424300 |
10 | 1161306720000 |
11 | 408564406139 |
12 | 16909b330000 |
13 | 8568418405b |
14 | 402c970a9a0 |
15 | 2031ccc0000 |
hex | 10e63464700 |
1161306720000 has 2160 divisors, whose sum is σ = 5271525971712. Its totient is φ = 248832000000.
The previous prime is 1161306719897. The next prime is 1161306720031. The reversal of 1161306720000 is 276031611.
It is a tau number, because it is divible by the number of its divisors (2160).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 4626719875 + ... + 4626720125.
Almost surely, 21161306720000 is an apocalyptic number.
1161306720000 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 1161306720000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2635762985856).
1161306720000 is an abundant number, since it is smaller than the sum of its proper divisors (4110219251712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1161306720000 is an frugal number, since it uses more digits than its factorization.
1161306720000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326 (or 285 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The spelling of 1161306720000 in words is "one trillion, one hundred sixty-one billion, three hundred six million, seven hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •