Base | Representation |
---|---|
bin | 100111001010… |
… | …010110010001 |
3 | 201022120022021 |
4 | 213022112101 |
5 | 10112003001 |
6 | 1004011441 |
7 | 153155014 |
oct | 47122621 |
9 | 21276267 |
10 | 10266001 |
11 | 5881aa9 |
12 | 3530b81 |
13 | 2185975 |
14 | 151337b |
15 | d7bba1 |
hex | 9ca591 |
10266001 has 4 divisors (see below), whose sum is σ = 10292004. Its totient is φ = 10240000.
The previous prime is 10265999. The next prime is 10266007. The reversal of 10266001 is 10066201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10233601 + 32400 = 3199^2 + 180^2 .
It is a 4-Lehmer number, since φ(10266001) divides (10266001-1)4.
It is a cyclic number.
It is not a de Polignac number, because 10266001 - 21 = 10265999 is a prime.
It is a deceptive number, since it divides R10266000.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10266007) 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, 12400 + ... + 13201.
It is an arithmetic number, because the mean of its divisors is an integer number (2573001).
It is a Poulet number, since it divides 210266000-1.
Almost surely, 210266001 is an apocalyptic number.
It is an amenable number.
10266001 is a deficient number, since it is larger than the sum of its proper divisors (26003).
10266001 is an equidigital number, since it uses as much as digits as its factorization.
10266001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26002.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 10266001 is about 3204.0600805853. The cubic root of 10266001 is about 217.3370497460.
The spelling of 10266001 in words is "ten million, two hundred sixty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •