Base | Representation |
---|---|
bin | 10000110100111… |
… | …10011100010110 |
3 | 100211121120121020 |
4 | 20122132130112 |
5 | 242114030131 |
6 | 22001302010 |
7 | 3332552562 |
oct | 1032363426 |
9 | 324546536 |
10 | 141158166 |
11 | 72753246 |
12 | 3b334906 |
13 | 23324556 |
14 | 14a666a2 |
15 | c5d4996 |
hex | 869e716 |
141158166 has 8 divisors (see below), whose sum is σ = 282316344. Its totient is φ = 47052720.
The previous prime is 141158117. The next prime is 141158189. The reversal of 141158166 is 661851141.
141158166 = 59392 + 59402 + ... + 59422.
141158166 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
141158166 is an admirable number.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11763175 + ... + 11763186.
It is an arithmetic number, because the mean of its divisors is an integer number (35289543).
Almost surely, 2141158166 is an apocalyptic number.
141158166 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141158166 is a wasteful number, since it uses less digits than its factorization.
141158166 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23526366.
The product of its digits is 5760, while the sum is 33.
The square root of 141158166 is about 11881.0002104200. Note that the first 3 decimals coincide. The cubic root of 141158166 is about 520.6773298805.
The spelling of 141158166 in words is "one hundred forty-one million, one hundred fifty-eight thousand, one hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •