Base | Representation |
---|---|
bin | 10100100001001… |
… | …00110110110011 |
3 | 102222212110201112 |
4 | 22100210312303 |
5 | 323030224202 |
6 | 25025023535 |
7 | 4156655036 |
oct | 1220446663 |
9 | 388773645 |
10 | 172117427 |
11 | 89179409 |
12 | 49784bab |
13 | 29874041 |
14 | 18c0501d |
15 | 1019cb52 |
hex | a424db3 |
172117427 has 4 divisors (see below), whose sum is σ = 172285080. Its totient is φ = 171949776.
The previous prime is 172117423. The next prime is 172117453. The reversal of 172117427 is 724711271.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 724711271 = 71 ⋅10207201.
It is a cyclic number.
It is not a de Polignac number, because 172117427 - 22 = 172117423 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 172117393 and 172117402.
It is not an unprimeable number, because it can be changed into a prime (172117423) 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 3 ways as a sum of consecutive naturals, for example, 82277 + ... + 84342.
It is an arithmetic number, because the mean of its divisors is an integer number (43071270).
Almost surely, 2172117427 is an apocalyptic number.
172117427 is a deficient number, since it is larger than the sum of its proper divisors (167653).
172117427 is a wasteful number, since it uses less digits than its factorization.
172117427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167652.
The product of its digits is 5488, while the sum is 32.
The square root of 172117427 is about 13119.3531471639. The cubic root of 172117427 is about 556.2563072634.
Adding to 172117427 its reverse (724711271), we get a palindrome (896828698).
The spelling of 172117427 in words is "one hundred seventy-two million, one hundred seventeen thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •