Base | Representation |
---|---|
bin | 111101111100100110… |
… | …1100110101110001101 |
3 | 110201101002121220001102 |
4 | 1323321031212232031 |
5 | 4134421202042031 |
6 | 141040240552445 |
7 | 12416416203353 |
oct | 1737115465615 |
9 | 421332556042 |
10 | 133030112141 |
11 | 51466037243 |
12 | 21947622725 |
13 | c7108a00b4 |
14 | 661daad7d3 |
15 | 36d8da47cb |
hex | 1ef9366b8d |
133030112141 has 2 divisors, whose sum is σ = 133030112142. Its totient is φ = 133030112140.
The previous prime is 133030112113. The next prime is 133030112147. The reversal of 133030112141 is 141211030331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72134679241 + 60895432900 = 268579^2 + 246770^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133030112141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133030112147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66515056070 + 66515056071.
It is an arithmetic number, because the mean of its divisors is an integer number (66515056071).
Almost surely, 2133030112141 is an apocalyptic number.
It is an amenable number.
133030112141 is a deficient number, since it is larger than the sum of its proper divisors (1).
133030112141 is an equidigital number, since it uses as much as digits as its factorization.
133030112141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 133030112141 its reverse (141211030331), we get a palindrome (274241142472).
The spelling of 133030112141 in words is "one hundred thirty-three billion, thirty million, one hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •