Base | Representation |
---|---|
bin | 1000001101101011100… |
… | …0101010100110010111 |
3 | 111111020021200202222101 |
4 | 2003122320222212113 |
5 | 4302443434203421 |
6 | 144454155342531 |
7 | 13123603521211 |
oct | 2033270524627 |
9 | 444207622871 |
10 | 141111241111 |
11 | 54932687025 |
12 | 23421a51a47 |
13 | 103cab7a409 |
14 | 6b890555b1 |
15 | 3a0d578191 |
hex | 20dae2a997 |
141111241111 has 8 divisors (see below), whose sum is σ = 143304699104. Its totient is φ = 138932858880.
The previous prime is 141111241087. The next prime is 141111241127. The reversal of 141111241111 is 111142111141.
141111241111 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.
It is a cyclic number.
It is not a de Polignac number, because 141111241111 - 217 = 141111110039 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141111241171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3750075 + ... + 3787516.
It is an arithmetic number, because the mean of its divisors is an integer number (17913087388).
Almost surely, 2141111241111 is an apocalyptic number.
141111241111 is a deficient number, since it is larger than the sum of its proper divisors (2193457993).
141111241111 is an equidigital number, since it uses as much as digits as its factorization.
141111241111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7537881.
The product of its digits is 32, while the sum is 19.
Adding to 141111241111 its reverse (111142111141), we get a palindrome (252253352252).
The spelling of 141111241111 in words is "one hundred forty-one billion, one hundred eleven million, two hundred forty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •