Base | Representation |
---|---|
bin | 11110010101110101101010… |
… | …111011111010101010100111 |
3 | 122111110221110200112122212202 |
4 | 132111311222323322222213 |
5 | 114442303442022323421 |
6 | 1151450245234205115 |
7 | 40051606311433631 |
oct | 3625655273725247 |
9 | 574427420478782 |
10 | 133442133011111 |
11 | 3957854428a141 |
12 | 12b71b9042379b |
13 | 595c701681212 |
14 | 24d48c2c25a51 |
15 | 10662095a610b |
hex | 795d6aefaaa7 |
133442133011111 has 8 divisors (see below), whose sum is σ = 133564544683248. Its totient is φ = 133319770776000.
The previous prime is 133442133011093. The next prime is 133442133011113. The reversal of 133442133011111 is 111110331244331.
It is a happy number.
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 133442133011111 - 214 = 133442132994727 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 (133442133011113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6957230 + ... + 17756331.
It is an arithmetic number, because the mean of its divisors is an integer number (16695568085406).
Almost surely, 2133442133011111 is an apocalyptic number.
133442133011111 is a deficient number, since it is larger than the sum of its proper divisors (122411672137).
133442133011111 is a wasteful number, since it uses less digits than its factorization.
133442133011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24718513.
The product of its (nonzero) digits is 2592, while the sum is 29.
Adding to 133442133011111 its reverse (111110331244331), we get a palindrome (244552464255442).
The spelling of 133442133011111 in words is "one hundred thirty-three trillion, four hundred forty-two billion, one hundred thirty-three million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •