Base | Representation |
---|---|
bin | 110000011011010010010… |
… | …1000110011001001000001 |
3 | 212120021102211201210220122 |
4 | 1200312210220303021001 |
5 | 1333021301111001121 |
6 | 22053323155350025 |
7 | 1254566422544450 |
oct | 140664450631101 |
9 | 25507384653818 |
10 | 6655666500161 |
11 | 213671a254488 |
12 | 8b5ab52b2315 |
13 | 39381b9c8ca3 |
14 | 1901c919cb97 |
15 | b81e0da85ab |
hex | 60da4a33241 |
6655666500161 has 8 divisors (see below), whose sum is σ = 7611983959104. Its totient is φ = 5700726030960.
The previous prime is 6655666500157. The next prime is 6655666500181. The reversal of 6655666500161 is 1610056665566.
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 6655666500161 - 22 = 6655666500157 is a prime.
It is a super-2 number, since 2×66556665001612 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (6655666500181) 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 7 ways as a sum of consecutive naturals, for example, 344237075 + ... + 344256408.
It is an arithmetic number, because the mean of its divisors is an integer number (951497994888).
Almost surely, 26655666500161 is an apocalyptic number.
It is an amenable number.
6655666500161 is a deficient number, since it is larger than the sum of its proper divisors (956317458943).
6655666500161 is a wasteful number, since it uses less digits than its factorization.
6655666500161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 688494871.
The product of its (nonzero) digits is 5832000, while the sum is 53.
The spelling of 6655666500161 in words is "six trillion, six hundred fifty-five billion, six hundred sixty-six million, five hundred thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •