Base | Representation |
---|---|
bin | 111011011001000… |
… | …100100011011111 |
3 | 2120102221210020201 |
4 | 323121010203133 |
5 | 4020041143444 |
6 | 242512524331 |
7 | 33456332620 |
oct | 7331044337 |
9 | 2512853221 |
10 | 996427999 |
11 | 471504116 |
12 | 2398506a7 |
13 | 12b589388 |
14 | 9649ba47 |
15 | 5c727dd4 |
hex | 3b6448df |
996427999 has 4 divisors (see below), whose sum is σ = 1138774864. Its totient is φ = 854081136.
The previous prime is 996427979. The next prime is 996428029. The reversal of 996427999 is 999724699.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 996427999 - 211 = 996425951 is a prime.
It is a super-2 number, since 2×9964279992 = 1985737514382288002, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 996427999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (996427979) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71173422 + ... + 71173435.
It is an arithmetic number, because the mean of its divisors is an integer number (284693716).
Almost surely, 2996427999 is an apocalyptic number.
996427999 is a deficient number, since it is larger than the sum of its proper divisors (142346865).
996427999 is a wasteful number, since it uses less digits than its factorization.
996427999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142346864.
The product of its digits is 19840464, while the sum is 64.
The square root of 996427999 is about 31566.2477814516. The cubic root of 996427999 is about 998.8079124921.
The spelling of 996427999 in words is "nine hundred ninety-six million, four hundred twenty-seven thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •