Base | Representation |
---|---|
bin | 10101000001111111… |
… | …11000110111001111 |
3 | 1002010220002010010120 |
4 | 22200333320313033 |
5 | 141111001142020 |
6 | 5104222040023 |
7 | 546542142420 |
oct | 124077706717 |
9 | 32126063116 |
10 | 11291037135 |
11 | 4874550354 |
12 | 2231419013 |
13 | 10ac307981 |
14 | 7917cd647 |
15 | 4613cc740 |
hex | 2a0ff8dcf |
11291037135 has 32 divisors (see below), whose sum is σ = 21860969472. Its totient is φ = 4857991680.
The previous prime is 11291037133. The next prime is 11291037193. The reversal of 11291037135 is 53173019211.
It is not a de Polignac number, because 11291037135 - 21 = 11291037133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11291037096 and 11291037105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11291037133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3160971 + ... + 3164540.
It is an arithmetic number, because the mean of its divisors is an integer number (683155296).
Almost surely, 211291037135 is an apocalyptic number.
11291037135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11291037135 is a deficient number, since it is larger than the sum of its proper divisors (10569932337).
11291037135 is a wasteful number, since it uses less digits than its factorization.
11291037135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6325543.
The product of its (nonzero) digits is 5670, while the sum is 33.
The spelling of 11291037135 in words is "eleven billion, two hundred ninety-one million, thirty-seven thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •