Base | Representation |
---|---|
bin | 100000100001001… |
… | …0000111011010100 |
3 | 2211001010021012000 |
4 | 1001002100323110 |
5 | 4213311101120 |
6 | 300134155300 |
7 | 36016206321 |
oct | 10102207324 |
9 | 2731107160 |
10 | 1091112660 |
11 | 50a9a5100 |
12 | 2654b2b30 |
13 | 14508b6c1 |
14 | a4ca7b48 |
15 | 65bcc990 |
hex | 41090ed4 |
1091112660 has 144 divisors (see below), whose sum is σ = 3731448000. Its totient is φ = 264496320.
The previous prime is 1091112641. The next prime is 1091112697. The reversal of 1091112660 is 662111901.
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 pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 56991 + ... + 73689.
Almost surely, 21091112660 is an apocalyptic number.
1091112660 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 1091112660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1865724000).
1091112660 is an abundant number, since it is smaller than the sum of its proper divisors (2640335340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1091112660 is a wasteful number, since it uses less digits than its factorization.
1091112660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16739 (or 16720 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 27.
The square root of 1091112660 is about 33031.9944901909. The cubic root of 1091112660 is about 1029.4925265860.
The spelling of 1091112660 in words is "one billion, ninety-one million, one hundred twelve thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •