Base | Representation |
---|---|
bin | 10100100110100… |
… | …01101110010101 |
3 | 110001012110000012 |
4 | 22103101232111 |
5 | 323220403433 |
6 | 25052130005 |
7 | 4165664261 |
oct | 1223215625 |
9 | 401173005 |
10 | 172825493 |
11 | 89612395 |
12 | 49a66905 |
13 | 29a61409 |
14 | 18d4b0a1 |
15 | 1028c848 |
hex | a4d1b95 |
172825493 has 2 divisors, whose sum is σ = 172825494. Its totient is φ = 172825492.
The previous prime is 172825423. The next prime is 172825507. The reversal of 172825493 is 394528271.
172825493 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 160833124 + 11992369 = 12682^2 + 3463^2 .
It is an emirp because it is prime and its reverse (394528271) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 172825493 - 210 = 172824469 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 172825493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (172825423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 86412746 + 86412747.
It is an arithmetic number, because the mean of its divisors is an integer number (86412747).
Almost surely, 2172825493 is an apocalyptic number.
It is an amenable number.
172825493 is a deficient number, since it is larger than the sum of its proper divisors (1).
172825493 is an equidigital number, since it uses as much as digits as its factorization.
172825493 is an evil number, because the sum of its binary digits is even.
The product of its digits is 120960, while the sum is 41.
The square root of 172825493 is about 13146.3110034717. The cubic root of 172825493 is about 557.0180494330.
The spelling of 172825493 in words is "one hundred seventy-two million, eight hundred twenty-five thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •