Base | Representation |
---|---|
bin | 10000110100111… |
… | …11001010110101 |
3 | 100211121201200102 |
4 | 20122133022311 |
5 | 242114124031 |
6 | 22001323445 |
7 | 3332564342 |
oct | 1032371265 |
9 | 324551612 |
10 | 141161141 |
11 | 72755500 |
12 | 3b336585 |
13 | 23325a04 |
14 | 14a677c9 |
15 | c5d57cb |
hex | 869f2b5 |
141161141 has 12 divisors (see below), whose sum is σ = 156625056. Its totient is φ = 127117320.
The previous prime is 141161117. The next prime is 141161147.
141161141 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-141161141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141161147) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7496 + ... + 18398.
It is an arithmetic number, because the mean of its divisors is an integer number (13052088).
Almost surely, 2141161141 is an apocalyptic number.
141161141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
141161141 is a deficient number, since it is larger than the sum of its proper divisors (15463915).
141161141 is a wasteful number, since it uses less digits than its factorization.
141161141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11032 (or 11021 counting only the distinct ones).
The product of its digits is 96, while the sum is 20.
The square root of 141161141 is about 11881.1254096571. The cubic root of 141161141 is about 520.6809877257.
The spelling of 141161141 in words is "one hundred forty-one million, one hundred sixty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •