Base | Representation |
---|---|
bin | 100101110000011011010110… |
… | …000011100110100000100101 |
3 | 210202221202120110012010212201 |
4 | 211300123112003212200211 |
5 | 133231123400404210331 |
6 | 1345100521450414501 |
7 | 46656056662306426 |
oct | 4560332603464045 |
9 | 722852513163781 |
10 | 166055616866341 |
11 | 48a01878729584 |
12 | 1675a836131431 |
13 | 7186c926a5397 |
14 | 2d011c5a2364d |
15 | 142e74ad56a61 |
hex | 9706d60e6825 |
166055616866341 has 8 divisors (see below), whose sum is σ = 168115233623904. Its totient is φ = 163997403601200.
The previous prime is 166055616866317. The next prime is 166055616866537. The reversal of 166055616866341 is 143668616550661.
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 166055616866341 - 27 = 166055616866213 is a prime.
It is a super-2 number, since 2×1660556168663412 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166055616866641) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 350635006 + ... + 351108271.
It is an arithmetic number, because the mean of its divisors is an integer number (21014404202988).
Almost surely, 2166055616866341 is an apocalyptic number.
It is an amenable number.
166055616866341 is a deficient number, since it is larger than the sum of its proper divisors (2059616757563).
166055616866341 is an equidigital number, since it uses as much as digits as its factorization.
166055616866341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701746211.
The product of its (nonzero) digits is 111974400, while the sum is 64.
The spelling of 166055616866341 in words is "one hundred sixty-six trillion, fifty-five billion, six hundred sixteen million, eight hundred sixty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •