Base | Representation |
---|---|
bin | 10100110001011111… |
… | …00001111111101011 |
3 | 1001210020110022000211 |
4 | 22120233201333223 |
5 | 140320022001220 |
6 | 5042353241551 |
7 | 543240644623 |
oct | 123057417753 |
9 | 31706408024 |
10 | 11152531435 |
11 | 4803349a31 |
12 | 21b2b632b7 |
13 | 1089701836 |
14 | 77b257883 |
15 | 45416db5a |
hex | 298be1feb |
11152531435 has 4 divisors (see below), whose sum is σ = 13383037728. Its totient is φ = 8922025144.
The previous prime is 11152531417. The next prime is 11152531457. The reversal of 11152531435 is 53413525111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11152531435 - 29 = 11152530923 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11152531397 and 11152531406.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1115253139 + ... + 1115253148.
It is an arithmetic number, because the mean of its divisors is an integer number (3345759432).
Almost surely, 211152531435 is an apocalyptic number.
11152531435 is a deficient number, since it is larger than the sum of its proper divisors (2230506293).
11152531435 is an equidigital number, since it uses as much as digits as its factorization.
11152531435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2230506292.
The product of its digits is 9000, while the sum is 31.
The spelling of 11152531435 in words is "eleven billion, one hundred fifty-two million, five hundred thirty-one thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •