Base | Representation |
---|---|
bin | 10100100101101… |
… | …00001010111001 |
3 | 110000222021221210 |
4 | 22102310022321 |
5 | 323203020231 |
6 | 25045353333 |
7 | 4164651330 |
oct | 1222641271 |
9 | 400867853 |
10 | 172704441 |
11 | 8953a448 |
12 | 49a08849 |
13 | 29a1b2a0 |
14 | 18d18d17 |
15 | 10266a46 |
hex | a4b42b9 |
172704441 has 32 divisors (see below), whose sum is σ = 292569088. Its totient is φ = 88153920.
The previous prime is 172704439. The next prime is 172704443. The reversal of 172704441 is 144407271.
It is an interprime number because it is at equal distance from previous prime (172704439) and next prime (172704443).
It is not a de Polignac number, because 172704441 - 21 = 172704439 is a prime.
It is a super-2 number, since 2×1727044412 = 59653647882244962, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 172704399 and 172704408.
It is not an unprimeable number, because it can be changed into a prime (172704443) 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 in 31 ways as a sum of consecutive naturals, for example, 1741 + ... + 18666.
It is an arithmetic number, because the mean of its divisors is an integer number (9142784).
Almost surely, 2172704441 is an apocalyptic number.
It is an amenable number.
172704441 is a deficient number, since it is larger than the sum of its proper divisors (119864647).
172704441 is a wasteful number, since it uses less digits than its factorization.
172704441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20461.
The product of its (nonzero) digits is 6272, while the sum is 30.
The square root of 172704441 is about 13141.7061677698. The cubic root of 172704441 is about 556.8879685120.
The spelling of 172704441 in words is "one hundred seventy-two million, seven hundred four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •