Base | Representation |
---|---|
bin | 10100110001111010… |
… | …00011001001110101 |
3 | 1001210111010100001121 |
4 | 22120331003021311 |
5 | 140321423401000 |
6 | 5043001223541 |
7 | 543313034236 |
oct | 123075031165 |
9 | 31714110047 |
10 | 11156075125 |
11 | 480534a3a8 |
12 | 21b4191bb1 |
13 | 108a3727b0 |
14 | 77b8db08d |
15 | 45461db1a |
hex | 298f43275 |
11156075125 has 16 divisors (see below), whose sum is σ = 14993767152. Its totient is φ = 8238331200.
The previous prime is 11156075107. The next prime is 11156075129. The reversal of 11156075125 is 52157065111.
11156075125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 4049922321 + 7106152804 = 63639^2 + 84298^2 .
It is not a de Polignac number, because 11156075125 - 219 = 11155550837 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11156075129) 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 15 ways as a sum of consecutive naturals, for example, 3431014 + ... + 3434263.
It is an arithmetic number, because the mean of its divisors is an integer number (937110447).
Almost surely, 211156075125 is an apocalyptic number.
It is an amenable number.
11156075125 is a deficient number, since it is larger than the sum of its proper divisors (3837692027).
11156075125 is an equidigital number, since it uses as much as digits as its factorization.
11156075125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6865305 (or 6865295 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 34.
The spelling of 11156075125 in words is "eleven billion, one hundred fifty-six million, seventy-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •