Base | Representation |
---|---|
bin | 100001010100… |
… | …1101010001101 |
3 | 1012212200021100 |
4 | 1002221222031 |
5 | 13433102031 |
6 | 1422253313 |
7 | 301340121 |
oct | 102515215 |
9 | 35780240 |
10 | 17472141 |
11 | 9954095 |
12 | 5a27239 |
13 | 380995b |
14 | 246b581 |
15 | 1801de6 |
hex | 10a9a8d |
17472141 has 12 divisors (see below), whose sum is σ = 26722332. Its totient is φ = 10962816.
The previous prime is 17472121. The next prime is 17472149. The reversal of 17472141 is 14127471.
It can be written as a sum of positive squares in 2 ways, for example, as 13286025 + 4186116 = 3645^2 + 2046^2 .
It is not a de Polignac number, because 17472141 - 213 = 17463949 is a prime.
It is a super-2 number, since 2×174721412 = 610551422247762, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (17472149) 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 11 ways as a sum of consecutive naturals, for example, 56946 + ... + 57251.
It is an arithmetic number, because the mean of its divisors is an integer number (2226861).
Almost surely, 217472141 is an apocalyptic number.
It is an amenable number.
17472141 is a deficient number, since it is larger than the sum of its proper divisors (9250191).
17472141 is a wasteful number, since it uses less digits than its factorization.
17472141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114220 (or 114217 counting only the distinct ones).
The product of its digits is 1568, while the sum is 27.
The square root of 17472141 is about 4179.9690190239. The cubic root of 17472141 is about 259.4868626893.
The spelling of 17472141 in words is "seventeen million, four hundred seventy-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •