Base | Representation |
---|---|
bin | 100010110000010… |
… | …0010100011101000 |
3 | 10000021022222010010 |
4 | 1011200202203220 |
5 | 4342014024211 |
6 | 311414451520 |
7 | 40620115500 |
oct | 10540424350 |
9 | 3007288103 |
10 | 1166158056 |
11 | 5492a1898 |
12 | 286663ba0 |
13 | 1577a586b |
14 | b0c40a00 |
15 | 6c5a34a6 |
hex | 458228e8 |
1166158056 has 96 divisors (see below), whose sum is σ = 3426675840. Its totient is φ = 329720832.
The previous prime is 1166158033. The next prime is 1166158067. The reversal of 1166158056 is 6508516611.
It is a super-2 number, since 2×11661580562 = 2719849223147398272, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 108961 + ... + 119183.
It is an arithmetic number, because the mean of its divisors is an integer number (35694540).
Almost surely, 21166158056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1166158056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1713337920).
1166158056 is an abundant number, since it is smaller than the sum of its proper divisors (2260517784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1166158056 is a wasteful number, since it uses less digits than its factorization.
1166158056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10343 (or 10332 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 39.
The square root of 1166158056 is about 34149.0564437731. The cubic root of 1166158056 is about 1052.5735979513.
The spelling of 1166158056 in words is "one billion, one hundred sixty-six million, one hundred fifty-eight thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •