Base | Representation |
---|---|
bin | 1101101110111011110000100… |
… | …0011111010011001001000101 |
3 | 11200201201201202200110121010001 |
4 | 3123232330020133103021011 |
5 | 2003131430243242344134 |
6 | 13303205013130401301 |
7 | 410361640406453455 |
oct | 33356741037231105 |
9 | 4621651680417101 |
10 | 966397848793669 |
11 | 25aa19031782146 |
12 | 9047a464290231 |
13 | 32630c06881996 |
14 | 1308dc967b3d65 |
15 | 76ad35c181414 |
hex | 36eef087d3245 |
966397848793669 has 8 divisors (see below), whose sum is σ = 1020078790686080. Its totient is φ = 915534804113820.
The previous prime is 966397848793661. The next prime is 966397848793681.
966397848793669 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 966397848793669 - 23 = 966397848793661 is a prime.
It is a super-2 number, since 2×9663978487936692 (a number of 31 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (966397848793661) 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, 70447423437 + ... + 70447437154.
It is an arithmetic number, because the mean of its divisors is an integer number (127509848835760).
Almost surely, 2966397848793669 is an apocalyptic number.
It is an amenable number.
966397848793669 is a deficient number, since it is larger than the sum of its proper divisors (53680941892411).
966397848793669 is an equidigital number, since it uses as much as digits as its factorization.
966397848793669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140894860648 (or 140894860610 counting only the distinct ones).
The product of its digits is 959961010176, while the sum is 100.
The spelling of 966397848793669 in words is "nine hundred sixty-six trillion, three hundred ninety-seven billion, eight hundred forty-eight million, seven hundred ninety-three thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •