Base | Representation |
---|---|
bin | 1001101011011001111… |
… | …0001000100110111101 |
3 | 120220011122112202010110 |
4 | 2122312132020212331 |
5 | 10211010122011031 |
6 | 204214453300233 |
7 | 15004220421462 |
oct | 2326636104675 |
9 | 526148482113 |
10 | 166270110141 |
11 | 64573162773 |
12 | 28283634679 |
13 | 128aa299675 |
14 | 8094555669 |
15 | 44d217cc46 |
hex | 26b67889bd |
166270110141 has 8 divisors (see below), whose sum is σ = 223765382304. Its totient is φ = 109810789040.
The previous prime is 166270110131. The next prime is 166270110161. The reversal of 166270110141 is 141011072661.
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 166270110141 - 214 = 166270093757 is a prime.
It is a super-3 number, since 3×1662701101413 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 166270110099 and 166270110108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166270110131) 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, 258987390 + ... + 258988031.
It is an arithmetic number, because the mean of its divisors is an integer number (27970672788).
Almost surely, 2166270110141 is an apocalyptic number.
It is an amenable number.
166270110141 is a deficient number, since it is larger than the sum of its proper divisors (57495272163).
166270110141 is a wasteful number, since it uses less digits than its factorization.
166270110141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 517975531.
The product of its (nonzero) digits is 2016, while the sum is 30.
The spelling of 166270110141 in words is "one hundred sixty-six billion, two hundred seventy million, one hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •