Base | Representation |
---|---|
bin | 100010100110100… |
… | …0100001000100000 |
3 | 2222220201120220000 |
4 | 1011031010020200 |
5 | 4334212141304 |
6 | 311113220000 |
7 | 40525533210 |
oct | 10515041040 |
9 | 2886646800 |
10 | 1161052704 |
11 | 546425099 |
12 | 284a01600 |
13 | 156708b46 |
14 | b02b2240 |
15 | 6bde5939 |
hex | 45344220 |
1161052704 has 240 divisors, whose sum is σ = 3951763200. Its totient is φ = 327545856.
The previous prime is 1161052699. The next prime is 1161052727. The reversal of 1161052704 is 4072501611.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1614457 + ... + 1615175.
It is an arithmetic number, because the mean of its divisors is an integer number (16465680).
Almost surely, 21161052704 is an apocalyptic number.
1161052704 is a gapful number since it is divisible by the number (14) 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 1161052704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1975881600).
1161052704 is an abundant number, since it is smaller than the sum of its proper divisors (2790710496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1161052704 is an equidigital number, since it uses as much as digits as its factorization.
1161052704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 837 (or 820 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The square root of 1161052704 is about 34074.2234541009. The cubic root of 1161052704 is about 1051.0353216731.
The spelling of 1161052704 in words is "one billion, one hundred sixty-one million, fifty-two thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •