Base | Representation |
---|---|
bin | 10000110100001… |
… | …01100110111001 |
3 | 100211102102001122 |
4 | 20122011212321 |
5 | 242102301231 |
6 | 21555155025 |
7 | 3331650161 |
oct | 1032054671 |
9 | 324372048 |
10 | 141056441 |
11 | 72693879 |
12 | 3b2a5a75 |
13 | 232ba166 |
14 | 14a3b5a1 |
15 | c5b477b |
hex | 86859b9 |
141056441 has 8 divisors (see below), whose sum is σ = 144966024. Its totient is φ = 137169280.
The previous prime is 141056411. The next prime is 141056449. The reversal of 141056441 is 144650141.
It can be written as a sum of positive squares in 4 ways, for example, as 2876416 + 138180025 = 1696^2 + 11755^2 .
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 141056441 - 214 = 141040057 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 141056441.
It is not an unprimeable number, because it can be changed into a prime (141056449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7571 + ... + 18423.
It is an arithmetic number, because the mean of its divisors is an integer number (18120753).
Almost surely, 2141056441 is an apocalyptic number.
It is an amenable number.
141056441 is a deficient number, since it is larger than the sum of its proper divisors (3909583).
141056441 is a wasteful number, since it uses less digits than its factorization.
141056441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11211.
The product of its (nonzero) digits is 1920, while the sum is 26.
The square root of 141056441 is about 11876.7184440821. The cubic root of 141056441 is about 520.5522252285.
The spelling of 141056441 in words is "one hundred forty-one million, fifty-six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •