Base | Representation |
---|---|
bin | 111101101110100110… |
… | …011000100010000001 |
3 | 20100002011122011120220 |
4 | 331232212120202001 |
5 | 2041220144041103 |
6 | 50240523453253 |
7 | 4534324154361 |
oct | 755646304201 |
9 | 210064564526 |
10 | 66280065153 |
11 | 26122406a55 |
12 | 10a19087229 |
13 | 6333864183 |
14 | 32ca9669a1 |
15 | 1acdc5cc53 |
hex | f6e998881 |
66280065153 has 4 divisors (see below), whose sum is σ = 88373420208. Its totient is φ = 44186710100.
The previous prime is 66280065113. The next prime is 66280065161. The reversal of 66280065153 is 35156008266.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-66280065153 is a prime.
It is a super-4 number, since 4×662800651534 (a number of 44 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (66280065113) 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, 11046677523 + ... + 11046677528.
It is an arithmetic number, because the mean of its divisors is an integer number (22093355052).
Almost surely, 266280065153 is an apocalyptic number.
It is an amenable number.
66280065153 is a deficient number, since it is larger than the sum of its proper divisors (22093355055).
66280065153 is a wasteful number, since it uses less digits than its factorization.
66280065153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22093355054.
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 66280065153 in words is "sixty-six billion, two hundred eighty million, sixty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •