Base | Representation |
---|---|
bin | 101000011110… |
… | …001011010100 |
3 | 201222000022102 |
4 | 220132023110 |
5 | 10203444424 |
6 | 1015221232 |
7 | 156115043 |
oct | 50361324 |
9 | 21860272 |
10 | 10609364 |
11 | 5a96a77 |
12 | 3677818 |
13 | 227603c |
14 | 15a255a |
15 | de87ae |
hex | a1e2d4 |
10609364 has 12 divisors (see below), whose sum is σ = 18871188. Its totient is φ = 5217600.
The previous prime is 10609351. The next prime is 10609367. The reversal of 10609364 is 46390601.
It can be written as a sum of positive squares in 2 ways, for example, as 3276100 + 7333264 = 1810^2 + 2708^2 .
It is a super-2 number, since 2×106093642 = 225117208968992, which contains 22 as substring.
It is a hoax number, since the sum of its digits (29) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10609367) 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, 21497 + ... + 21984.
It is an arithmetic number, because the mean of its divisors is an integer number (1572599).
Almost surely, 210609364 is an apocalyptic number.
It is an amenable number.
10609364 is a deficient number, since it is larger than the sum of its proper divisors (8261824).
10609364 is a wasteful number, since it uses less digits than its factorization.
10609364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43546 (or 43544 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 29.
The square root of 10609364 is about 3257.2018666334. The cubic root of 10609364 is about 219.7335893640.
Adding to 10609364 its reverse (46390601), we get a palindrome (56999965).
The spelling of 10609364 in words is "ten million, six hundred nine thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •