Base | Representation |
---|---|
bin | 10100100101101… |
… | …10010010011001 |
3 | 110000222201211222 |
4 | 22102312102121 |
5 | 323203304423 |
6 | 25045501425 |
7 | 4165015526 |
oct | 1222662231 |
9 | 400881758 |
10 | 172713113 |
11 | 89545a11 |
12 | 49a11875 |
13 | 29a22211 |
14 | 18d1c14d |
15 | 102693c8 |
hex | a4b6499 |
172713113 has 2 divisors, whose sum is σ = 172713114. Its totient is φ = 172713112.
The previous prime is 172713071. The next prime is 172713139. The reversal of 172713113 is 311317271.
It is an a-pointer prime, because the next prime (172713139) can be obtained adding 172713113 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122699929 + 50013184 = 11077^2 + 7072^2 .
It is an emirp because it is prime and its reverse (311317271) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 172713113 - 216 = 172647577 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (172713193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 86356556 + 86356557.
It is an arithmetic number, because the mean of its divisors is an integer number (86356557).
Almost surely, 2172713113 is an apocalyptic number.
It is an amenable number.
172713113 is a deficient number, since it is larger than the sum of its proper divisors (1).
172713113 is an equidigital number, since it uses as much as digits as its factorization.
172713113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 882, while the sum is 26.
The square root of 172713113 is about 13142.0361055660. The cubic root of 172713113 is about 556.8972893524.
The spelling of 172713113 in words is "one hundred seventy-two million, seven hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •