Base | Representation |
---|---|
bin | 100001010111… |
… | …0000011010101 |
3 | 1012220120221201 |
4 | 1002232003111 |
5 | 13434141013 |
6 | 1422512501 |
7 | 301443433 |
oct | 102560325 |
9 | 35816851 |
10 | 17490133 |
11 | 9966661 |
12 | 5a35731 |
13 | 3814bbb |
14 | 2473d53 |
15 | 18073dd |
hex | 10ae0d5 |
17490133 has 2 divisors, whose sum is σ = 17490134. Its totient is φ = 17490132.
The previous prime is 17490131. The next prime is 17490139. The reversal of 17490133 is 33109471.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12552849 + 4937284 = 3543^2 + 2222^2 .
It is a cyclic number.
It is not a de Polignac number, because 17490133 - 21 = 17490131 is a prime.
Together with 17490131, it forms a pair of twin primes.
It is a nialpdrome in base 11.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (17490131) 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 as a sum of consecutive naturals, namely, 8745066 + 8745067.
It is an arithmetic number, because the mean of its divisors is an integer number (8745067).
Almost surely, 217490133 is an apocalyptic number.
It is an amenable number.
17490133 is a deficient number, since it is larger than the sum of its proper divisors (1).
17490133 is an equidigital number, since it uses as much as digits as its factorization.
17490133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 28.
The square root of 17490133 is about 4182.1206343194. The cubic root of 17490133 is about 259.5759013102.
The spelling of 17490133 in words is "seventeen million, four hundred ninety thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •