Base | Representation |
---|---|
bin | 100000110110… |
… | …0001000011111 |
3 | 1012101212120111 |
4 | 1001230020133 |
5 | 13402021002 |
6 | 1413030451 |
7 | 266240311 |
oct | 101541037 |
9 | 35355514 |
10 | 17220127 |
11 | 97a1811 |
12 | 5925427 |
13 | 374c032 |
14 | 24037b1 |
15 | 17a23d7 |
hex | 106c21f |
17220127 has 8 divisors (see below), whose sum is σ = 17534880. Its totient is φ = 16907520.
The previous prime is 17220109. The next prime is 17220157. The reversal of 17220127 is 72102271.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 17220127 - 219 = 16695839 is a prime.
It is a super-2 number, since 2×172201272 = 593065547792258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 17220098 and 17220107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (17220157) 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, 28743 + ... + 29335.
It is an arithmetic number, because the mean of its divisors is an integer number (2191860).
Almost surely, 217220127 is an apocalyptic number.
17220127 is a deficient number, since it is larger than the sum of its proper divisors (314753).
17220127 is an equidigital number, since it uses as much as digits as its factorization.
17220127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1073.
The product of its (nonzero) digits is 392, while the sum is 22.
The square root of 17220127 is about 4149.7140865366. The cubic root of 17220127 is about 258.2332235990.
Adding to 17220127 its reverse (72102271), we get a palindrome (89322398).
The spelling of 17220127 in words is "seventeen million, two hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •