Base | Representation |
---|---|
bin | 10100110001001111… |
… | …10101000100110011 |
3 | 1001210002122201111001 |
4 | 22120213311010303 |
5 | 140314012344220 |
6 | 5042242102431 |
7 | 543214535416 |
oct | 123047650463 |
9 | 31702581431 |
10 | 11150512435 |
11 | 48021a0037 |
12 | 21b234aa17 |
13 | 108917586a |
14 | 77ac8db7d |
15 | 453dc080a |
hex | 2989f5133 |
11150512435 has 4 divisors (see below), whose sum is σ = 13380614928. Its totient is φ = 8920409944.
The previous prime is 11150512427. The next prime is 11150512523. The reversal of 11150512435 is 53421505111.
11150512435 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11150512435 - 23 = 11150512427 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1115051239 + ... + 1115051248.
It is an arithmetic number, because the mean of its divisors is an integer number (3345153732).
Almost surely, 211150512435 is an apocalyptic number.
11150512435 is a deficient number, since it is larger than the sum of its proper divisors (2230102493).
11150512435 is an equidigital number, since it uses as much as digits as its factorization.
11150512435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2230102492.
The product of its (nonzero) digits is 3000, while the sum is 28.
The spelling of 11150512435 in words is "eleven billion, one hundred fifty million, five hundred twelve thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •