Base | Representation |
---|---|
bin | 101000011100… |
… | …111010110110 |
3 | 201221202020200 |
4 | 220130322312 |
5 | 10203313324 |
6 | 1015141330 |
7 | 156064035 |
oct | 50347266 |
9 | 21852220 |
10 | 10604214 |
11 | 5a93115 |
12 | 3674846 |
13 | 22738aa |
14 | 15a071c |
15 | de6ec9 |
hex | a1ceb6 |
10604214 has 12 divisors (see below), whose sum is σ = 22975836. Its totient is φ = 3534732.
The previous prime is 10604213. The next prime is 10604221. The reversal of 10604214 is 41240601.
It is a super-2 number, since 2×106042142 = 224898709115592, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 589123 = 10604214 / (1 + 0 + 6 + 0 + 4 + 2 + 1 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10604213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 294544 + ... + 294579.
It is an arithmetic number, because the mean of its divisors is an integer number (1914653).
Almost surely, 210604214 is an apocalyptic number.
10604214 is an abundant number, since it is smaller than the sum of its proper divisors (12371622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10604214 is a wasteful number, since it uses less digits than its factorization.
10604214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589131 (or 589128 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 10604214 is about 3256.4112148192. The cubic root of 10604214 is about 219.6980292324.
Adding to 10604214 its reverse (41240601), we get a palindrome (51844815).
The spelling of 10604214 in words is "ten million, six hundred four thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •