Base | Representation |
---|---|
bin | 10101001011001011… |
… | …00101000001111101 |
3 | 1002100020221120022210 |
4 | 22211211211001331 |
5 | 141240203314422 |
6 | 5120012131033 |
7 | 551465425431 |
oct | 124545450175 |
9 | 32306846283 |
10 | 11368026237 |
11 | 4903a55407 |
12 | 2253166a79 |
13 | 10c2252759 |
14 | 79bb109c1 |
15 | 46803910c |
hex | 2a596507d |
11368026237 has 8 divisors (see below), whose sum is σ = 15176389536. Its totient is φ = 7569173552.
The previous prime is 11368026227. The next prime is 11368026239. The reversal of 11368026237 is 73262086311.
11368026237 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11368026237 - 210 = 11368025213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11368026195 and 11368026204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11368026239) 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 7 ways as a sum of consecutive naturals, for example, 2374863 + ... + 2379644.
It is an arithmetic number, because the mean of its divisors is an integer number (1897048692).
Almost surely, 211368026237 is an apocalyptic number.
It is an amenable number.
11368026237 is a deficient number, since it is larger than the sum of its proper divisors (3808363299).
11368026237 is an equidigital number, since it uses as much as digits as its factorization.
11368026237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4755307.
The product of its (nonzero) digits is 72576, while the sum is 39.
The spelling of 11368026237 in words is "eleven billion, three hundred sixty-eight million, twenty-six thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •