Base | Representation |
---|---|
bin | 10100100001010… |
… | …11001000001101 |
3 | 102222220202222000 |
4 | 22100223020031 |
5 | 323032034432 |
6 | 25025342513 |
7 | 4160122656 |
oct | 1220531015 |
9 | 388822860 |
10 | 172143117 |
11 | 89196743 |
12 | 49797a39 |
13 | 29882943 |
14 | 18c1052d |
15 | 101a557c |
hex | a42b20d |
172143117 has 8 divisors (see below), whose sum is σ = 255026880. Its totient is φ = 114762060.
The previous prime is 172143113. The next prime is 172143151. The reversal of 172143117 is 711341271.
It is not a de Polignac number, because 172143117 - 22 = 172143113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 6375671 = 172143117 / (1 + 7 + 2 + 1 + 4 + 3 + 1 + 1 + 7).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (172143113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3187809 + ... + 3187862.
It is an arithmetic number, because the mean of its divisors is an integer number (31878360).
Almost surely, 2172143117 is an apocalyptic number.
It is an amenable number.
172143117 is a deficient number, since it is larger than the sum of its proper divisors (82883763).
172143117 is an equidigital number, since it uses as much as digits as its factorization.
172143117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6375680 (or 6375674 counting only the distinct ones).
The product of its digits is 1176, while the sum is 27.
The square root of 172143117 is about 13120.3321985383. The cubic root of 172143117 is about 556.2839812258.
Adding to 172143117 its reverse (711341271), we get a palindrome (883484388).
The spelling of 172143117 in words is "one hundred seventy-two million, one hundred forty-three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •