Base | Representation |
---|---|
bin | 10100100111000110… |
… | …10010101111011110 |
3 | 1001120011120110010120 |
4 | 22103203102233132 |
5 | 140130222442100 |
6 | 5030002415410 |
7 | 541132443465 |
oct | 122343225736 |
9 | 31504513116 |
10 | 11065437150 |
11 | 4769172789 |
12 | 2189961566 |
13 | 1074659361 |
14 | 76d8659dc |
15 | 44b6b80a0 |
hex | 2938d2bde |
11065437150 has 24 divisors (see below), whose sum is σ = 27442284504. Its totient is φ = 2950783200.
The previous prime is 11065437101. The next prime is 11065437167. The reversal of 11065437150 is 5173456011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 36884641 + ... + 36884940.
It is an arithmetic number, because the mean of its divisors is an integer number (1143428521).
Almost surely, 211065437150 is an apocalyptic number.
11065437150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11065437150 is an abundant number, since it is smaller than the sum of its proper divisors (16376847354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11065437150 is a wasteful number, since it uses less digits than its factorization.
11065437150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73769596 (or 73769591 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 33.
The spelling of 11065437150 in words is "eleven billion, sixty-five million, four hundred thirty-seven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •