Base | Representation |
---|---|
bin | 100000111101101… |
… | …0111110101010000 |
3 | 2212002021211211200 |
4 | 1001323113311100 |
5 | 4231124130102 |
6 | 301431111200 |
7 | 36260360136 |
oct | 10173276520 |
9 | 2762254750 |
10 | 1106083152 |
11 | 51839a709 |
12 | 26a512500 |
13 | 148200795 |
14 | a6c83756 |
15 | 6718851c |
hex | 41ed7d50 |
1106083152 has 120 divisors (see below), whose sum is σ = 3212187264. Its totient is φ = 355041792.
The previous prime is 1106083141. The next prime is 1106083183. The reversal of 1106083152 is 2513806011.
1106083152 is a `hidden beast` number, since 1 + 1 + 0 + 608 + 3 + 1 + 52 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 450793 + ... + 453239.
Almost surely, 21106083152 is an apocalyptic number.
1106083152 is a gapful number since it is divisible by the number (12) 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 1106083152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1606093632).
1106083152 is an abundant number, since it is smaller than the sum of its proper divisors (2106104112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1106083152 is a wasteful number, since it uses less digits than its factorization.
1106083152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2577 (or 2568 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 1106083152 is about 33257.8284318144. The cubic root of 1106083152 is about 1034.1795023503.
Adding to 1106083152 its reverse (2513806011), we get a palindrome (3619889163).
The spelling of 1106083152 in words is "one billion, one hundred six million, eighty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •