Base | Representation |
---|---|
bin | 111110010111010001… |
… | …011000110001010101 |
3 | 20101211201121202000121 |
4 | 332113101120301111 |
5 | 2044114340130330 |
6 | 50432341111541 |
7 | 4560251144410 |
oct | 762721306125 |
9 | 211751552017 |
10 | 66962426965 |
11 | 264425a9535 |
12 | 10b896b85b1 |
13 | 6412039165 |
14 | 335342cb77 |
15 | 1b1dae917a |
hex | f97458c55 |
66962426965 has 8 divisors (see below), whose sum is σ = 91834185600. Its totient is φ = 45917092752.
The previous prime is 66962426963. The next prime is 66962427001. The reversal of 66962426965 is 56962426966.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 66962426965 - 21 = 66962426963 is a prime.
It is a super-2 number, since 2×669624269652 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66962426963) 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 in 7 ways as a sum of consecutive naturals, for example, 956606065 + ... + 956606134.
It is an arithmetic number, because the mean of its divisors is an integer number (11479273200).
Almost surely, 266962426965 is an apocalyptic number.
It is an amenable number.
66962426965 is a deficient number, since it is larger than the sum of its proper divisors (24871758635).
66962426965 is a wasteful number, since it uses less digits than its factorization.
66962426965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1913212211.
The product of its digits is 50388480, while the sum is 61.
Subtracting from 66962426965 its reverse (56962426966), we obtain a palindrome (9999999999).
The spelling of 66962426965 in words is "sixty-six billion, nine hundred sixty-two million, four hundred twenty-six thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •