Base | Representation |
---|---|
bin | 10100101110111010… |
… | …11001110011111100 |
3 | 1001201201221111100100 |
4 | 22113131121303330 |
5 | 140244014031413 |
6 | 5040304001100 |
7 | 542556646122 |
oct | 122735316374 |
9 | 31651844310 |
10 | 11131002108 |
11 | 47a21846a6 |
12 | 21a7900190 |
13 | 10851042a5 |
14 | 778451912 |
15 | 452319a73 |
hex | 297759cfc |
11131002108 has 18 divisors (see below), whose sum is σ = 28136699864. Its totient is φ = 3710334024.
The previous prime is 11131002107. The next prime is 11131002109. The reversal of 11131002108 is 80120013111.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11131002107) and next prime (11131002109).
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131002101) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 154597216 + ... + 154597287.
Almost surely, 211131002108 is an apocalyptic number.
11131002108 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
11131002108 is an abundant number, since it is smaller than the sum of its proper divisors (17005697756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11131002108 is a wasteful number, since it uses less digits than its factorization.
11131002108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309194513 (or 309194508 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 11131002108 its reverse (80120013111), we get a palindrome (91251015219).
The spelling of 11131002108 in words is "eleven billion, one hundred thirty-one million, two thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •