Base | Representation |
---|---|
bin | 10101001100010110… |
… | …01001100011000000 |
3 | 1002100221110221110211 |
4 | 22212023021203000 |
5 | 141300214001021 |
6 | 5121003203504 |
7 | 551645225425 |
oct | 124613114300 |
9 | 32327427424 |
10 | 11377875136 |
11 | 4909571aa1 |
12 | 2256516594 |
13 | 10c42c05c4 |
14 | 79d155d4c |
15 | 468d323e1 |
hex | 2a62c98c0 |
11377875136 has 28 divisors (see below), whose sum is σ = 22755766528. Its totient is φ = 5644138752.
The previous prime is 11377875101. The next prime is 11377875137. The reversal of 11377875136 is 63157877311.
It is a happy number.
11377875136 is an admirable number.
It is a super-2 number, since 2×113778751362 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11377875136.
It is not an unprimeable number, because it can be changed into a prime (11377875137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 691791 + ... + 708046.
Almost surely, 211377875136 is an apocalyptic number.
11377875136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11377875136 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11377875136 is a wasteful number, since it uses less digits than its factorization.
11377875136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1399976 (or 1399966 counting only the distinct ones).
The product of its digits is 740880, while the sum is 49.
The spelling of 11377875136 in words is "eleven billion, three hundred seventy-seven million, eight hundred seventy-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •