Base | Representation |
---|---|
bin | 10100101111001010… |
… | …00100100000110000 |
3 | 1001201212201121102101 |
4 | 22113211010200300 |
5 | 140300022341031 |
6 | 5040415030144 |
7 | 542613016660 |
oct | 122745044060 |
9 | 31655647371 |
10 | 11133012016 |
11 | 47a3327785 |
12 | 21a850b354 |
13 | 1085659099 |
14 | 7788161a0 |
15 | 4525b5361 |
hex | 297944830 |
11133012016 has 40 divisors (see below), whose sum is σ = 24775596800. Its totient is φ = 4747305024.
The previous prime is 11133012001. The next prime is 11133012031. The reversal of 11133012016 is 61021033111.
It is an interprime number because it is at equal distance from previous prime (11133012001) and next prime (11133012031).
It is a junction number, because it is equal to n+sod(n) for n = 11133011984 and 11133012002.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 227466 + ... + 272041.
It is an arithmetic number, because the mean of its divisors is an integer number (619389920).
Almost surely, 211133012016 is an apocalyptic number.
11133012016 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11133012016 is an abundant number, since it is smaller than the sum of its proper divisors (13642584784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11133012016 is a wasteful number, since it uses less digits than its factorization.
11133012016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499721 (or 499715 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11133012016 its reverse (61021033111), we get a palindrome (72154045127).
The spelling of 11133012016 in words is "eleven billion, one hundred thirty-three million, twelve thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •