Base | Representation |
---|---|
bin | 10000110100000… |
… | …10100111110011 |
3 | 100211101210021200 |
4 | 20122002213303 |
5 | 242101403321 |
6 | 21555022243 |
7 | 3331566420 |
oct | 1032024763 |
9 | 324353250 |
10 | 141044211 |
11 | 72685670 |
12 | 3b29a983 |
13 | 232b4719 |
14 | 14a36d47 |
15 | c5b0d26 |
hex | 86829f3 |
141044211 has 48 divisors (see below), whose sum is σ = 265075200. Its totient is φ = 70076160.
The previous prime is 141044191. The next prime is 141044213. The reversal of 141044211 is 112440141.
141044211 is a `hidden beast` number, since 1 + 410 + 44 + 211 = 666.
It is not a de Polignac number, because 141044211 - 211 = 141042163 is a prime.
It is a super-2 number, since 2×1410442112 = 39786938913225042, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (141044213) 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 47 ways as a sum of consecutive naturals, for example, 11515 + ... + 20363.
It is an arithmetic number, because the mean of its divisors is an integer number (5522400).
Almost surely, 2141044211 is an apocalyptic number.
141044211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
141044211 is a deficient number, since it is larger than the sum of its proper divisors (124030989).
141044211 is a wasteful number, since it uses less digits than its factorization.
141044211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8896 (or 8893 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
The square root of 141044211 is about 11876.2035600608. The cubic root of 141044211 is about 520.5371803343.
Adding to 141044211 its reverse (112440141), we get a palindrome (253484352).
The spelling of 141044211 in words is "one hundred forty-one million, forty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •