Base | Representation |
---|---|
bin | 100010110000000… |
… | …0111000101000000 |
3 | 10000021010020201112 |
4 | 1011200013011000 |
5 | 4342001424004 |
6 | 311412222452 |
7 | 40616136401 |
oct | 10540070500 |
9 | 3007106645 |
10 | 1166045504 |
11 | 549225278 |
12 | 28660aa28 |
13 | 157766570 |
14 | b0c119a8 |
15 | 6c57ee6e |
hex | 45807140 |
1166045504 has 112 divisors (see below), whose sum is σ = 2777947200. Its totient is φ = 479748096.
The previous prime is 1166045473. The next prime is 1166045533. The reversal of 1166045504 is 4055406611.
It is a super-2 number, since 2×11660455042 = 2719324234797228032, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 266567 + ... + 270905.
It is an arithmetic number, because the mean of its divisors is an integer number (24803100).
Almost surely, 21166045504 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 1166045504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1388973600).
1166045504 is an abundant number, since it is smaller than the sum of its proper divisors (1611901696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1166045504 is a wasteful number, since it uses less digits than its factorization.
1166045504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4400 (or 4390 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
The square root of 1166045504 is about 34147.4084521798. The cubic root of 1166045504 is about 1052.5397337380.
The spelling of 1166045504 in words is "one billion, one hundred sixty-six million, forty-five thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •