Base | Representation |
---|---|
bin | 10100101111100100… |
… | …01111100000101001 |
3 | 1001202010020000221100 |
4 | 22113302033200221 |
5 | 140301413334222 |
6 | 5041021032013 |
7 | 542654250543 |
oct | 122762174051 |
9 | 31663200840 |
10 | 11136464937 |
11 | 47a5275a34 |
12 | 21a96b5609 |
13 | 1086297930 |
14 | 779074693 |
15 | 452a484ac |
hex | 297c8f829 |
11136464937 has 24 divisors (see below), whose sum is σ = 17617017600. Its totient is φ = 6737048928.
The previous prime is 11136464917. The next prime is 11136464947. The reversal of 11136464937 is 73946463111.
11136464937 is a `hidden beast` number, since 1 + 113 + 6 + 46 + 493 + 7 = 666.
11136464937 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11136464937 - 27 = 11136464809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11136464892 and 11136464901.
It is not an unprimeable number, because it can be changed into a prime (11136464917) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 799737 + ... + 813542.
It is an arithmetic number, because the mean of its divisors is an integer number (734042400).
Almost surely, 211136464937 is an apocalyptic number.
It is an amenable number.
11136464937 is a deficient number, since it is larger than the sum of its proper divisors (6480552663).
11136464937 is a wasteful number, since it uses less digits than its factorization.
11136464937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1613357 (or 1613354 counting only the distinct ones).
The product of its digits is 326592, while the sum is 45.
The spelling of 11136464937 in words is "eleven billion, one hundred thirty-six million, four hundred sixty-four thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •