Base | Representation |
---|---|
bin | 10011010111101011110… |
… | …01101011010011000101 |
3 | 2100121220100200112021211 |
4 | 21223311321223103011 |
5 | 41401021412013221 |
6 | 1225425533011421 |
7 | 66040650626365 |
oct | 11536571532305 |
9 | 2317810615254 |
10 | 665550501061 |
11 | 2372929a8216 |
12 | a8ba3623b71 |
13 | 4a9b8300844 |
14 | 242d9d789a5 |
15 | 124a4a186e1 |
hex | 9af5e6b4c5 |
665550501061 has 4 divisors (see below), whose sum is σ = 694487479392. Its totient is φ = 636613522732.
The previous prime is 665550501029. The next prime is 665550501101. The reversal of 665550501061 is 160105055566.
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 not a de Polignac number, because 665550501061 - 25 = 665550501029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (665550901061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14468489131 + ... + 14468489176.
It is an arithmetic number, because the mean of its divisors is an integer number (173621869848).
Almost surely, 2665550501061 is an apocalyptic number.
It is an amenable number.
665550501061 is a deficient number, since it is larger than the sum of its proper divisors (28936978331).
665550501061 is a wasteful number, since it uses less digits than its factorization.
665550501061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28936978330.
The product of its (nonzero) digits is 135000, while the sum is 40.
It can be divided in two parts, 665550 and 501061, that added together give a palindrome (1166611).
The spelling of 665550501061 in words is "six hundred sixty-five billion, five hundred fifty million, five hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •