Base | Representation |
---|---|
bin | 10000110101010… |
… | …11010110100001 |
3 | 100211201021010120 |
4 | 20122223112201 |
5 | 242122223131 |
6 | 22002350453 |
7 | 3333162666 |
oct | 1032532641 |
9 | 324637116 |
10 | 141211041 |
11 | 72789a44 |
12 | 3b35b429 |
13 | 2334263a |
14 | 14a7ba6d |
15 | c5e5496 |
hex | 86ab5a1 |
141211041 has 4 divisors (see below), whose sum is σ = 188281392. Its totient is φ = 94140692.
The previous prime is 141211033. The next prime is 141211051. The reversal of 141211041 is 140112141.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 141211041 - 23 = 141211033 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 141211041.
It is not an unprimeable number, because it can be changed into a prime (141211001) 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 3 ways as a sum of consecutive naturals, for example, 23535171 + ... + 23535176.
It is an arithmetic number, because the mean of its divisors is an integer number (47070348).
Almost surely, 2141211041 is an apocalyptic number.
It is an amenable number.
141211041 is a deficient number, since it is larger than the sum of its proper divisors (47070351).
141211041 is an equidigital number, since it uses as much as digits as its factorization.
141211041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47070350.
The product of its (nonzero) digits is 32, while the sum is 15.
The square root of 141211041 is about 11883.2251935239. The cubic root of 141211041 is about 520.7423335045.
Adding to 141211041 its reverse (140112141), we get a palindrome (281323182).
The spelling of 141211041 in words is "one hundred forty-one million, two hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •