Base | Representation |
---|---|
bin | 101000011110… |
… | …001001001111 |
3 | 201222000010111 |
4 | 220132021033 |
5 | 10203443411 |
6 | 1015220451 |
7 | 156114463 |
oct | 50361117 |
9 | 21860114 |
10 | 10609231 |
11 | 5a96966 |
12 | 3677727 |
13 | 2275c69 |
14 | 15a24a3 |
15 | de8721 |
hex | a1e24f |
10609231 has 4 divisors (see below), whose sum is σ = 10703232. Its totient is φ = 10515232.
The previous prime is 10609219. The next prime is 10609253. The reversal of 10609231 is 13290601.
10609231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13290601 = 41 ⋅324161.
It is a cyclic number.
It is not a de Polignac number, because 10609231 - 211 = 10607183 is a prime.
It is a super-2 number, since 2×106092312 = 225111564822722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10609271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46831 + ... + 47056.
It is an arithmetic number, because the mean of its divisors is an integer number (2675808).
Almost surely, 210609231 is an apocalyptic number.
10609231 is a deficient number, since it is larger than the sum of its proper divisors (94001).
10609231 is an equidigital number, since it uses as much as digits as its factorization.
10609231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94000.
The product of its (nonzero) digits is 324, while the sum is 22.
The square root of 10609231 is about 3257.1814502726. The cubic root of 10609231 is about 219.7326711598.
Adding to 10609231 its reverse (13290601), we get a palindrome (23899832).
The spelling of 10609231 in words is "ten million, six hundred nine thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •