Base | Representation |
---|---|
bin | 111011010111110… |
… | …011101101001111 |
3 | 2120102022221222211 |
4 | 323113303231033 |
5 | 4020000044342 |
6 | 242501451251 |
7 | 33453453304 |
oct | 7327635517 |
9 | 2512287884 |
10 | 996096847 |
11 | 4712a8339 |
12 | 239710b27 |
13 | 12b4a1725 |
14 | 964130ab |
15 | 5c6aec17 |
hex | 3b5f3b4f |
996096847 has 4 divisors (see below), whose sum is σ = 996342336. Its totient is φ = 995851360.
The previous prime is 996096841. The next prime is 996096853. The reversal of 996096847 is 748690699.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 748690699 = 599 ⋅1249901.
It is an interprime number because it is at equal distance from previous prime (996096841) and next prime (996096853).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-996096847 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 996096791 and 996096800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (996096841) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 116554 + ... + 124807.
It is an arithmetic number, because the mean of its divisors is an integer number (249085584).
Almost surely, 2996096847 is an apocalyptic number.
996096847 is a deficient number, since it is larger than the sum of its proper divisors (245489).
996096847 is a wasteful number, since it uses less digits than its factorization.
996096847 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245488.
The product of its (nonzero) digits is 5878656, while the sum is 58.
The square root of 996096847 is about 31561.0019961344. The cubic root of 996096847 is about 998.6972525862.
The spelling of 996096847 in words is "nine hundred ninety-six million, ninety-six thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •