Base | Representation |
---|---|
bin | 100110110001… |
… | …100101010001 |
3 | 201010102011020 |
4 | 212301211101 |
5 | 10100231221 |
6 | 1001510053 |
7 | 152253201 |
oct | 46614521 |
9 | 21112136 |
10 | 10164561 |
11 | 5812870 |
12 | 34a2329 |
13 | 214b744 |
14 | 14c8401 |
15 | d5bac6 |
hex | 9b1951 |
10164561 has 8 divisors (see below), whose sum is σ = 14784864. Its totient is φ = 6160320.
The previous prime is 10164541. The next prime is 10164571. The reversal of 10164561 is 16546101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10164561 - 213 = 10156369 is a prime.
It is a Smith number, since the sum of its digits (24) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10164541) 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 7 ways as a sum of consecutive naturals, for example, 153976 + ... + 154041.
It is an arithmetic number, because the mean of its divisors is an integer number (1848108).
Almost surely, 210164561 is an apocalyptic number.
10164561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10164561 is a deficient number, since it is larger than the sum of its proper divisors (4620303).
10164561 is a wasteful number, since it uses less digits than its factorization.
10164561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308031.
The product of its (nonzero) digits is 720, while the sum is 24.
The square root of 10164561 is about 3188.1908663065. The cubic root of 10164561 is about 216.6188315174.
The spelling of 10164561 in words is "ten million, one hundred sixty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •