Base | Representation |
---|---|
bin | 10101011110101110… |
… | …11110101000011101 |
3 | 1002202200200111012022 |
4 | 22233113132220131 |
5 | 142104204232143 |
6 | 5144152545525 |
7 | 555530152064 |
oct | 125727365035 |
9 | 32680614168 |
10 | 11532102173 |
11 | 4988631059 |
12 | 229a0b22a5 |
13 | 111a23c4c7 |
14 | 7b58211db |
15 | 477649268 |
hex | 2af5dea1d |
11532102173 has 2 divisors, whose sum is σ = 11532102174. Its totient is φ = 11532102172.
The previous prime is 11532102163. The next prime is 11532102187. The reversal of 11532102173 is 37120123511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11465483929 + 66618244 = 107077^2 + 8162^2 .
It is a cyclic number.
It is not a de Polignac number, because 11532102173 - 24 = 11532102157 is a prime.
It is a super-2 number, since 2×115321021732 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11532102163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5766051086 + 5766051087.
It is an arithmetic number, because the mean of its divisors is an integer number (5766051087).
Almost surely, 211532102173 is an apocalyptic number.
It is an amenable number.
11532102173 is a deficient number, since it is larger than the sum of its proper divisors (1).
11532102173 is an equidigital number, since it uses as much as digits as its factorization.
11532102173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 26.
Adding to 11532102173 its reverse (37120123511), we get a palindrome (48652225684).
The spelling of 11532102173 in words is "eleven billion, five hundred thirty-two million, one hundred two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •