Base | Representation |
---|---|
bin | 101000000010… |
… | …100110000001 |
3 | 201202021100000 |
4 | 220002212001 |
5 | 10141341020 |
6 | 1012550213 |
7 | 155134464 |
oct | 50024601 |
9 | 21667300 |
10 | 10496385 |
11 | 5a1a0a9 |
12 | 3622369 |
13 | 22367a3 |
14 | 15732db |
15 | dc5090 |
hex | a02981 |
10496385 has 48 divisors (see below), whose sum is σ = 19341504. Its totient is φ = 5458752.
The previous prime is 10496377. The next prime is 10496389. The reversal of 10496385 is 58369401.
10496385 is a `hidden beast` number, since 10 + 4 + 9 + 638 + 5 = 666.
It is not a de Polignac number, because 10496385 - 23 = 10496377 is a prime.
It is a super-2 number, since 2×104963852 = 220348196136450, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10496389) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 64314 + ... + 64476.
It is an arithmetic number, because the mean of its divisors is an integer number (402948).
Almost surely, 210496385 is an apocalyptic number.
10496385 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10496385 is a deficient number, since it is larger than the sum of its proper divisors (8845119).
10496385 is an equidigital number, since it uses as much as digits as its factorization.
10496385 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236 (or 224 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 10496385 is about 3239.8124945743. The cubic root of 10496385 is about 218.9508240119.
The spelling of 10496385 in words is "ten million, four hundred ninety-six thousand, three hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •