Base | Representation |
---|---|
bin | 101000000010… |
… | …111100101111 |
3 | 201202100022212 |
4 | 220002330233 |
5 | 10141412324 |
6 | 1013001035 |
7 | 155141642 |
oct | 50027457 |
9 | 21670285 |
10 | 10497839 |
11 | 5a20200 |
12 | 362317b |
13 | 2237351 |
14 | 1573a59 |
15 | dc570e |
hex | a02f2f |
10497839 has 12 divisors (see below), whose sum is σ = 11666760. Its totient is φ = 9438000.
The previous prime is 10497827. The next prime is 10497841. The reversal of 10497839 is 93879401.
It is a happy number.
10497839 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10497839 - 28 = 10497583 is a prime.
It is a super-2 number, since 2×104978392 = 220409247339842, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10497796 and 10497805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10497859) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11792 + ... + 12650.
It is an arithmetic number, because the mean of its divisors is an integer number (972230).
Almost surely, 210497839 is an apocalyptic number.
10497839 is a deficient number, since it is larger than the sum of its proper divisors (1168921).
10497839 is a wasteful number, since it uses less digits than its factorization.
10497839 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 982 (or 971 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 41.
The square root of 10497839 is about 3240.0368825061. The cubic root of 10497839 is about 218.9609335179.
It can be divided in two parts, 1049 and 7839, that added together give a palindrome (8888).
The spelling of 10497839 in words is "ten million, four hundred ninety-seven thousand, eight hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •