Base | Representation |
---|---|
bin | 10100100001001… |
… | …11110011101001 |
3 | 102222220002022011 |
4 | 22100213303221 |
5 | 323031121023 |
6 | 25025155521 |
7 | 4160035213 |
oct | 1220476351 |
9 | 388802264 |
10 | 172129513 |
11 | 891874a6 |
12 | 4978bba1 |
13 | 298796aa |
14 | 18c095b3 |
15 | 101a150d |
hex | a427ce9 |
172129513 has 4 divisors (see below), whose sum is σ = 176781700. Its totient is φ = 167477328.
The previous prime is 172129511. The next prime is 172129537. The reversal of 172129513 is 315921271.
172129513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 315921271 = 1013 ⋅311867.
It can be written as a sum of positive squares in 2 ways, for example, as 126607504 + 45522009 = 11252^2 + 6747^2 .
It is a cyclic number.
It is not a de Polignac number, because 172129513 - 21 = 172129511 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (172129511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2326038 + ... + 2326111.
It is an arithmetic number, because the mean of its divisors is an integer number (44195425).
Almost surely, 2172129513 is an apocalyptic number.
It is an amenable number.
172129513 is a deficient number, since it is larger than the sum of its proper divisors (4652187).
172129513 is an equidigital number, since it uses as much as digits as its factorization.
172129513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4652186.
The product of its digits is 3780, while the sum is 31.
The square root of 172129513 is about 13119.8137563000. The cubic root of 172129513 is about 556.2693269723.
The spelling of 172129513 in words is "one hundred seventy-two million, one hundred twenty-nine thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •