Base | Representation |
---|---|
bin | 100000100001… |
… | …1010110000000 |
3 | 1012002101101200 |
4 | 1001003112000 |
5 | 13331144211 |
6 | 1405301200 |
7 | 264643236 |
oct | 101032600 |
9 | 35071350 |
10 | 17053056 |
11 | 9698239 |
12 | 5864800 |
13 | 36c0c87 |
14 | 239c956 |
15 | 176cb56 |
hex | 1043580 |
17053056 has 96 divisors (see below), whose sum is σ = 49884120. Its totient is φ = 5591040.
The previous prime is 17053039. The next prime is 17053067. The reversal of 17053056 is 65035071.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 130111 + ... + 130241.
Almost surely, 217053056 is an apocalyptic number.
17053056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 17053056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24942060).
17053056 is an abundant number, since it is smaller than the sum of its proper divisors (32831064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
17053056 is a wasteful number, since it uses less digits than its factorization.
17053056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264 (or 249 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 27.
The square root of 17053056 is about 4129.5345984747. The cubic root of 17053056 is about 257.3953752228.
It can be divided in two parts, 1705 and 3056, that added together give a square (4761 = 692).
The spelling of 17053056 in words is "seventeen million, fifty-three thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •