Base | Representation |
---|---|
bin | 111110000111110010… |
… | …1100010110000111101 |
3 | 110202100020221212101011 |
4 | 1330033211202300331 |
5 | 4141203301024031 |
6 | 141141410315221 |
7 | 12431624631244 |
oct | 1741745426075 |
9 | 422306855334 |
10 | 133405486141 |
11 | 51638a12294 |
12 | 21a31288b11 |
13 | c77059b7a5 |
14 | 66578a395b |
15 | 370bd016b1 |
hex | 1f0f962c3d |
133405486141 has 2 divisors, whose sum is σ = 133405486142. Its totient is φ = 133405486140.
The previous prime is 133405486051. The next prime is 133405486219. The reversal of 133405486141 is 141684504331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123851205625 + 9554280516 = 351925^2 + 97746^2 .
It is an emirp because it is prime and its reverse (141684504331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133405486141 is a prime.
It is a super-3 number, since 3×1334054861413 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133405486094 and 133405486103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133405496141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66702743070 + 66702743071.
It is an arithmetic number, because the mean of its divisors is an integer number (66702743071).
Almost surely, 2133405486141 is an apocalyptic number.
It is an amenable number.
133405486141 is a deficient number, since it is larger than the sum of its proper divisors (1).
133405486141 is an equidigital number, since it uses as much as digits as its factorization.
133405486141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 40.
The spelling of 133405486141 in words is "one hundred thirty-three billion, four hundred five million, four hundred eighty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •