Base | Representation |
---|---|
bin | 100000100001… |
… | …1010101100111 |
3 | 1012002101100202 |
4 | 1001003111213 |
5 | 13331144111 |
6 | 1405301115 |
7 | 264643202 |
oct | 101032547 |
9 | 35071322 |
10 | 17053031 |
11 | 9698216 |
12 | 586479b |
13 | 36c0c68 |
14 | 239c939 |
15 | 176cb3b |
hex | 1043567 |
17053031 has 4 divisors (see below), whose sum is σ = 17065752. Its totient is φ = 17040312.
The previous prime is 17052961. The next prime is 17053039. The reversal of 17053031 is 13035071.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13035071 = 7 ⋅1862153.
It is a cyclic number.
It is not a de Polignac number, because 17053031 - 218 = 16790887 is a prime.
It is a super-2 number, since 2×170530312 = 581611732573922, 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 = 17052994 and 17053012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (17053039) 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 3 ways as a sum of consecutive naturals, for example, 4076 + ... + 7121.
It is an arithmetic number, because the mean of its divisors is an integer number (4266438).
Almost surely, 217053031 is an apocalyptic number.
17053031 is a deficient number, since it is larger than the sum of its proper divisors (12721).
17053031 is a wasteful number, since it uses less digits than its factorization.
17053031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12720.
The product of its (nonzero) digits is 315, while the sum is 20.
The square root of 17053031 is about 4129.5315714982. The cubic root of 17053031 is about 257.3952494411.
The spelling of 17053031 in words is "seventeen million, fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •