Base | Representation |
---|---|
bin | 100110001000… |
… | …100101011101 |
3 | 200210212210211 |
4 | 212020211131 |
5 | 10024343022 |
6 | 554132421 |
7 | 150653500 |
oct | 46104535 |
9 | 20725724 |
10 | 9996637 |
11 | 5708692 |
12 | 3421111 |
13 | 20c0191 |
14 | 1483137 |
15 | d26e77 |
hex | 98895d |
9996637 has 6 divisors (see below), whose sum is σ = 11628798. Its totient is φ = 8568504.
The previous prime is 9996631. The next prime is 9996647. The reversal of 9996637 is 7366999.
It can be written as a sum of positive squares in only one way, i.e., 9572836 + 423801 = 3094^2 + 651^2 .
It is not a de Polignac number, because 9996637 - 27 = 9996509 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49), and also a Moran number because the ratio is a prime number: 204013 = 9996637 / (9 + 9 + 9 + 6 + 6 + 3 + 7).
It is an Ulam number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9996631) 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 5 ways as a sum of consecutive naturals, for example, 101958 + ... + 102055.
It is an arithmetic number, because the mean of its divisors is an integer number (1938133).
Almost surely, 29996637 is an apocalyptic number.
It is an amenable number.
9996637 is a deficient number, since it is larger than the sum of its proper divisors (1632161).
9996637 is a wasteful number, since it uses less digits than its factorization.
9996637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204027 (or 204020 counting only the distinct ones).
The product of its digits is 551124, while the sum is 49.
The square root of 9996637 is about 3161.7458784665. The cubic root of 9996637 is about 215.4193150825.
The spelling of 9996637 in words is "nine million, nine hundred ninety-six thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •