Base | Representation |
---|---|
bin | 110000011101101000010… |
… | …1110101011101001111001 |
3 | 212120202102201102102112021 |
4 | 1200323100232223221321 |
5 | 1333112104002112121 |
6 | 22055514530514441 |
7 | 1255135246053511 |
oct | 140732056535171 |
9 | 25522381372467 |
10 | 6660701207161 |
11 | 2138873207361 |
12 | 8b6a7b435a21 |
13 | 394141aba161 |
14 | 190545ad6841 |
15 | b83d7db8641 |
hex | 60ed0baba79 |
6660701207161 has 8 divisors (see below), whose sum is σ = 6662823825384. Its totient is φ = 6658578769920.
The previous prime is 6660701207119. The next prime is 6660701207177. The reversal of 6660701207161 is 1617021070666.
It can be written as a sum of positive squares in 4 ways, for example, as 1478449287225 + 5182251919936 = 1215915^2 + 2276456^2 .
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 6660701207161 - 211 = 6660701205113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6660701207561) 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, 127006401 + ... + 127058833.
It is an arithmetic number, because the mean of its divisors is an integer number (832852978173).
Almost surely, 26660701207161 is an apocalyptic number.
It is an amenable number.
6660701207161 is a deficient number, since it is larger than the sum of its proper divisors (2122618223).
6660701207161 is a wasteful number, since it uses less digits than its factorization.
6660701207161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90491.
The product of its (nonzero) digits is 127008, while the sum is 43.
The spelling of 6660701207161 in words is "six trillion, six hundred sixty billion, seven hundred one million, two hundred seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •