Base | Representation |
---|---|
bin | 100101111110… |
… | …110100010111 |
3 | 200201211221010 |
4 | 211332310113 |
5 | 10022103011 |
6 | 553223303 |
7 | 150426036 |
oct | 45766427 |
9 | 20654833 |
10 | 9956631 |
11 | 5690623 |
12 | 3401b33 |
13 | 20a7bc9 |
14 | 147271d |
15 | d1a1a6 |
hex | 97ed17 |
9956631 has 8 divisors (see below), whose sum is σ = 13852800. Its totient is φ = 6349112.
The previous prime is 9956623. The next prime is 9956641. The reversal of 9956631 is 1366599.
9956631 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 9956631 - 23 = 9956623 is a prime.
It is a super-2 number, since 2×99566312 = 198269001740322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 9956631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9956641) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72081 + ... + 72218.
It is an arithmetic number, because the mean of its divisors is an integer number (1731600).
Almost surely, 29956631 is an apocalyptic number.
9956631 is a deficient number, since it is larger than the sum of its proper divisors (3896169).
9956631 is a wasteful number, since it uses less digits than its factorization.
9956631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144325.
The product of its digits is 43740, while the sum is 39.
The square root of 9956631 is about 3155.4129682183. The cubic root of 9956631 is about 215.1315654092.
It can be divided in two parts, 995 and 6631, that added together give a triangular number (7626 = T123).
The spelling of 9956631 in words is "nine million, nine hundred fifty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •