Base | Representation |
---|---|
bin | 10100101001110… |
… | …11000100110101 |
3 | 110002000100221102 |
4 | 22110323010311 |
5 | 323323211023 |
6 | 25105255445 |
7 | 4202442326 |
oct | 1224730465 |
9 | 402010842 |
10 | 173257013 |
11 | 89887616 |
12 | 4a034585 |
13 | 29b82957 |
14 | 1902044d |
15 | 10325628 |
hex | a53b135 |
173257013 has 8 divisors (see below), whose sum is σ = 184106520. Its totient is φ = 162480640.
The previous prime is 173257003. The next prime is 173257043. The reversal of 173257013 is 310752371.
173257013 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 4 ways, for example, as 115390564 + 57866449 = 10742^2 + 7607^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 173257013 - 24 = 173256997 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 (173257003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13358 + ... + 22911.
It is an arithmetic number, because the mean of its divisors is an integer number (23013315).
Almost surely, 2173257013 is an apocalyptic number.
It is an amenable number.
173257013 is a deficient number, since it is larger than the sum of its proper divisors (10849507).
173257013 is a wasteful number, since it uses less digits than its factorization.
173257013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36567.
The product of its (nonzero) digits is 4410, while the sum is 29.
The square root of 173257013 is about 13162.7129802332. The cubic root of 173257013 is about 557.4812616786.
The spelling of 173257013 in words is "one hundred seventy-three million, two hundred fifty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •