Base | Representation |
---|---|
bin | 1111111100010… |
… | …11101000000101 |
3 | 100022122202020122 |
4 | 13332023220011 |
5 | 233214203221 |
6 | 21134311325 |
7 | 3212531426 |
oct | 776135005 |
9 | 308582218 |
10 | 133741061 |
11 | 69547703 |
12 | 38958545 |
13 | 2192852c |
14 | 13a9564d |
15 | bb1beab |
hex | 7f8ba05 |
133741061 has 2 divisors, whose sum is σ = 133741062. Its totient is φ = 133741060.
The previous prime is 133741043. The next prime is 133741063. The reversal of 133741061 is 160147331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107536900 + 26204161 = 10370^2 + 5119^2 .
It is an emirp because it is prime and its reverse (160147331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133741061 - 214 = 133724677 is a prime.
Together with 133741063, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133741061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133741063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66870530 + 66870531.
It is an arithmetic number, because the mean of its divisors is an integer number (66870531).
Almost surely, 2133741061 is an apocalyptic number.
It is an amenable number.
133741061 is a deficient number, since it is larger than the sum of its proper divisors (1).
133741061 is an equidigital number, since it uses as much as digits as its factorization.
133741061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 26.
The square root of 133741061 is about 11564.6470330918. The cubic root of 133741061 is about 511.3931676207.
Adding to 133741061 its reverse (160147331), we get a palindrome (293888392).
The spelling of 133741061 in words is "one hundred thirty-three million, seven hundred forty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •