Base | Representation |
---|---|
bin | 10100110001100000… |
… | …10111111000101101 |
3 | 1001210020212111211022 |
4 | 22120300113320231 |
5 | 140320101032143 |
6 | 5042402103525 |
7 | 543242554313 |
oct | 123060277055 |
9 | 31706774738 |
10 | 11152752173 |
11 | 480348a862 |
12 | 21b304aba5 |
13 | 108977b154 |
14 | 77b2b40b3 |
15 | 4541b4268 |
hex | 298c17e2d |
11152752173 has 4 divisors (see below), whose sum is σ = 11157434688. Its totient is φ = 11148069660.
The previous prime is 11152752161. The next prime is 11152752179. The reversal of 11152752173 is 37125725111.
11152752173 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11152752173 - 220 = 11151703597 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11152752179) 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 3 ways as a sum of consecutive naturals, for example, 2337683 + ... + 2342448.
It is an arithmetic number, because the mean of its divisors is an integer number (2789358672).
Almost surely, 211152752173 is an apocalyptic number.
It is an amenable number.
11152752173 is a deficient number, since it is larger than the sum of its proper divisors (4682515).
11152752173 is an equidigital number, since it uses as much as digits as its factorization.
11152752173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4682514.
The product of its digits is 14700, while the sum is 35.
The spelling of 11152752173 in words is "eleven billion, one hundred fifty-two million, seven hundred fifty-two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •