Base | Representation |
---|---|
bin | 111111111100010… |
… | …1000011100101101 |
3 | 12112112020100021022 |
4 | 1333320220130231 |
5 | 13343230132143 |
6 | 552522343525 |
7 | 104111615102 |
oct | 17770503455 |
9 | 5475210238 |
10 | 2145552173 |
11 | a01121116 |
12 | 4ba65aba5 |
13 | 2826798cb |
14 | 164d46aa9 |
15 | c8564268 |
hex | 7fe2872d |
2145552173 has 4 divisors (see below), whose sum is σ = 2146121628. Its totient is φ = 2144982720.
The previous prime is 2145552163. The next prime is 2145552179. The reversal of 2145552173 is 3712555412.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1023168169 + 1122384004 = 31987^2 + 33502^2 .
It is a cyclic number.
It is not a de Polignac number, because 2145552173 - 214 = 2145535789 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2145552179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 279038 + ... + 286623.
It is an arithmetic number, because the mean of its divisors is an integer number (536530407).
Almost surely, 22145552173 is an apocalyptic number.
It is an amenable number.
2145552173 is a deficient number, since it is larger than the sum of its proper divisors (569455).
2145552173 is an equidigital number, since it uses as much as digits as its factorization.
2145552173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569454.
The product of its digits is 42000, while the sum is 35.
The square root of 2145552173 is about 46320.1054942667. The cubic root of 2145552173 is about 1289.7722437080.
The spelling of 2145552173 in words is "two billion, one hundred forty-five million, five hundred fifty-two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •