Base | Representation |
---|---|
bin | 100110101100… |
… | …001110010001 |
3 | 201002022001012 |
4 | 212230032101 |
5 | 10044030414 |
6 | 1001220305 |
7 | 152132201 |
oct | 46541621 |
9 | 21068035 |
10 | 10142609 |
11 | 57a8324 |
12 | 3491695 |
13 | 2141759 |
14 | 14c0401 |
15 | d5533e |
hex | 9ac391 |
10142609 has 4 divisors (see below), whose sum is σ = 10583616. Its totient is φ = 9701604.
The previous prime is 10142603. The next prime is 10142617. The reversal of 10142609 is 90624101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10142609 - 24 = 10142593 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23), and also a Moran number because the ratio is a prime number: 440983 = 10142609 / (1 + 0 + 1 + 4 + 2 + 6 + 0 + 9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10142603) 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, 220469 + ... + 220514.
It is an arithmetic number, because the mean of its divisors is an integer number (2645904).
Almost surely, 210142609 is an apocalyptic number.
It is an amenable number.
10142609 is a deficient number, since it is larger than the sum of its proper divisors (441007).
10142609 is an equidigital number, since it uses as much as digits as its factorization.
10142609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441006.
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 10142609 is about 3184.7463007279. The cubic root of 10142609 is about 216.4627780843.
The spelling of 10142609 in words is "ten million, one hundred forty-two thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •