Base | Representation |
---|---|
bin | 111001100111101… |
… | …001111110110001 |
3 | 2111101000021211012 |
4 | 321213221332301 |
5 | 3434433300011 |
6 | 235531400305 |
7 | 32645534153 |
oct | 7147517661 |
9 | 2441007735 |
10 | 966696881 |
11 | 456747747 |
12 | 22b8b3095 |
13 | 1253798b7 |
14 | 9255cad3 |
15 | 59d03a8b |
hex | 399e9fb1 |
966696881 has 2 divisors, whose sum is σ = 966696882. Its totient is φ = 966696880.
The previous prime is 966696833. The next prime is 966696919. The reversal of 966696881 is 188696669.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 537544225 + 429152656 = 23185^2 + 20716^2 .
It is a cyclic number.
It is not a de Polignac number, because 966696881 - 226 = 899588017 is a prime.
It is a super-2 number, since 2×9666968812 = 1869005719470256322, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 966696881.
It is not a weakly prime, because it can be changed into another prime (966696781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 483348440 + 483348441.
It is an arithmetic number, because the mean of its divisors is an integer number (483348441).
Almost surely, 2966696881 is an apocalyptic number.
It is an amenable number.
966696881 is a deficient number, since it is larger than the sum of its proper divisors (1).
966696881 is an equidigital number, since it uses as much as digits as its factorization.
966696881 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6718464, while the sum is 59.
The square root of 966696881 is about 31091.7494039818. The cubic root of 966696881 is about 988.7733953356.
The spelling of 966696881 in words is "nine hundred sixty-six million, six hundred ninety-six thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •