Base | Representation |
---|---|
bin | 100000100001… |
… | …1000111110011 |
3 | 1012002100011000 |
4 | 1001003013303 |
5 | 13331132042 |
6 | 1405253043 |
7 | 264640500 |
oct | 101030763 |
9 | 35070130 |
10 | 17052147 |
11 | 9697592 |
12 | 5864183 |
13 | 36c0738 |
14 | 239c4a7 |
15 | 176c74c |
hex | 10431f3 |
17052147 has 24 divisors (see below), whose sum is σ = 29389200. Its totient is φ = 9743328.
The previous prime is 17052109. The next prime is 17052149. The reversal of 17052147 is 74125071.
It is not a de Polignac number, because 17052147 - 26 = 17052083 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 17052147.
It is not an unprimeable number, because it can be changed into a prime (17052149) 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 23 ways as a sum of consecutive naturals, for example, 5122 + ... + 7767.
It is an arithmetic number, because the mean of its divisors is an integer number (1224550).
Almost surely, 217052147 is an apocalyptic number.
17052147 is a deficient number, since it is larger than the sum of its proper divisors (12337053).
17052147 is a wasteful number, since it uses less digits than its factorization.
17052147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12912 (or 12899 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 27.
The square root of 17052147 is about 4129.4245361793. The cubic root of 17052147 is about 257.3908017208.
The spelling of 17052147 in words is "seventeen million, fifty-two thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •