Base | Representation |
---|---|
bin | 10011010111101100111… |
… | …10010111101011000001 |
3 | 2100121221000210012222212 |
4 | 21223312132113223001 |
5 | 41401031342320001 |
6 | 1225430515111505 |
7 | 66041125451060 |
oct | 11536636275301 |
9 | 2317830705885 |
10 | 665560120001 |
11 | 237298378057 |
12 | a8ba68a2595 |
13 | 4a9ba2bab1a |
14 | 242db3601d7 |
15 | 124a57b87bb |
hex | 9af6797ac1 |
665560120001 has 8 divisors (see below), whose sum is σ = 760700429760. Its totient is φ = 570434883408.
The previous prime is 665560119997. The next prime is 665560120031. The reversal of 665560120001 is 100021065566.
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 665560120001 - 22 = 665560119997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 665560120001.
It is not an unprimeable number, because it can be changed into a prime (665560120031) 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 7 ways as a sum of consecutive naturals, for example, 3673511 + ... + 3850428.
It is an arithmetic number, because the mean of its divisors is an integer number (95087553720).
Almost surely, 2665560120001 is an apocalyptic number.
It is an amenable number.
665560120001 is a deficient number, since it is larger than the sum of its proper divisors (95140309759).
665560120001 is a wasteful number, since it uses less digits than its factorization.
665560120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7536583.
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 665560120001 its reverse (100021065566), we get a palindrome (765581185567).
The spelling of 665560120001 in words is "six hundred sixty-five billion, five hundred sixty million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •