Base | Representation |
---|---|
bin | 10100100011100… |
… | …00011001110101 |
3 | 110000110012012100 |
4 | 22101300121311 |
5 | 323120124434 |
6 | 25035412313 |
7 | 4162414146 |
oct | 1221603165 |
9 | 400405170 |
10 | 172426869 |
11 | 8936a94a |
12 | 498b4099 |
13 | 29951b44 |
14 | 18c85acd |
15 | 1020e699 |
hex | a470675 |
172426869 has 12 divisors (see below), whose sum is σ = 263711916. Its totient is φ = 108189312.
The previous prime is 172426831. The next prime is 172426871. The reversal of 172426869 is 968624271.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 141491025 + 30935844 = 11895^2 + 5562^2 .
It is not a de Polignac number, because 172426869 - 27 = 172426741 is a prime.
It is a super-2 number, since 2×1724268692 = 59462050306286322, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (172426819) 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 11 ways as a sum of consecutive naturals, for example, 563334 + ... + 563639.
It is an arithmetic number, because the mean of its divisors is an integer number (21975993).
Almost surely, 2172426869 is an apocalyptic number.
It is an amenable number.
172426869 is a deficient number, since it is larger than the sum of its proper divisors (91285047).
172426869 is a wasteful number, since it uses less digits than its factorization.
172426869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1126996 (or 1126993 counting only the distinct ones).
The product of its digits is 290304, while the sum is 45.
The square root of 172426869 is about 13131.1411918386. The cubic root of 172426869 is about 556.5894635584.
The spelling of 172426869 in words is "one hundred seventy-two million, four hundred twenty-six thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •