Base | Representation |
---|---|
bin | 10010100100000110… |
… | …11110000011111011 |
3 | 221201120212111211112 |
4 | 21102003132003323 |
5 | 130402420411432 |
6 | 4324550150535 |
7 | 501660332333 |
oct | 112203360373 |
9 | 27646774745 |
10 | 9966575867 |
11 | 4254965a66 |
12 | 1b2195244b |
13 | c2aab6a91 |
14 | 6a79420c3 |
15 | 3d4ea97b2 |
hex | 2520de0fb |
9966575867 has 2 divisors, whose sum is σ = 9966575868. Its totient is φ = 9966575866.
The previous prime is 9966575863. The next prime is 9966575881. The reversal of 9966575867 is 7685756699.
9966575867 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (7685756699) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 9966575867 - 22 = 9966575863 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 9966575797 and 9966575806.
It is not a weakly prime, because it can be changed into another prime (9966575863) 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 as a sum of consecutive naturals, namely, 4983287933 + 4983287934.
It is an arithmetic number, because the mean of its divisors is an integer number (4983287934).
Almost surely, 29966575867 is an apocalyptic number.
9966575867 is a deficient number, since it is larger than the sum of its proper divisors (1).
9966575867 is an equidigital number, since it uses as much as digits as its factorization.
9966575867 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 171460800, while the sum is 68.
The square root of 9966575867 is about 99832.7394545497. The cubic root of 9966575867 is about 2152.0316736947.
The spelling of 9966575867 in words is "nine billion, nine hundred sixty-six million, five hundred seventy-five thousand, eight hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •