Base | Representation |
---|---|
bin | 100000010100010100000101… |
… | …011100100110101100000111 |
3 | 200122020211021002201121102212 |
4 | 200110110011130212230013 |
5 | 122112203243143023421 |
6 | 1222143111450254035 |
7 | 41636542150025555 |
oct | 4024240534465407 |
9 | 618224232647385 |
10 | 142133444111111 |
11 | 41319500875882 |
12 | 13b364b6a2731b |
13 | 614018454825b |
14 | 271541c816bd5 |
15 | 116733c899e5b |
hex | 814505726b07 |
142133444111111 has 16 divisors (see below), whose sum is σ = 142644109977600. Its totient is φ = 141623655614208.
The previous prime is 142133444111063. The next prime is 142133444111171. The reversal of 142133444111111 is 111111444331241.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 142133444111111 - 222 = 142133439916807 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 (142133444111171) 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 15 ways as a sum of consecutive naturals, for example, 1484018021 + ... + 1484113793.
It is an arithmetic number, because the mean of its divisors is an integer number (8915256873600).
Almost surely, 2142133444111111 is an apocalyptic number.
142133444111111 is a deficient number, since it is larger than the sum of its proper divisors (510665866489).
142133444111111 is a wasteful number, since it uses less digits than its factorization.
142133444111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100298.
The product of its digits is 4608, while the sum is 32.
Adding to 142133444111111 its reverse (111111444331241), we get a palindrome (253244888442352).
The spelling of 142133444111111 in words is "one hundred forty-two trillion, one hundred thirty-three billion, four hundred forty-four million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •