Base | Representation |
---|---|
bin | 1111111010101… |
… | …11010101100001 |
3 | 100022020212110001 |
4 | 13331113111201 |
5 | 233140330011 |
6 | 21125540001 |
7 | 3210650125 |
oct | 775272541 |
9 | 308225401 |
10 | 133526881 |
11 | 694107a4 |
12 | 38874601 |
13 | 21881bb7 |
14 | 13a3b585 |
15 | bac87c1 |
hex | 7f57561 |
133526881 has 2 divisors, whose sum is σ = 133526882. Its totient is φ = 133526880.
The previous prime is 133526867. The next prime is 133526903. The reversal of 133526881 is 188625331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 125776225 + 7750656 = 11215^2 + 2784^2 .
It is a cyclic number.
It is not a de Polignac number, because 133526881 - 29 = 133526369 is a prime.
It is a super-2 number, since 2×1335268812 = 35658855899176322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133526881.
It is not a weakly prime, because it can be changed into another prime (133526801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66763440 + 66763441.
It is an arithmetic number, because the mean of its divisors is an integer number (66763441).
Almost surely, 2133526881 is an apocalyptic number.
It is an amenable number.
133526881 is a deficient number, since it is larger than the sum of its proper divisors (1).
133526881 is an equidigital number, since it uses as much as digits as its factorization.
133526881 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34560, while the sum is 37.
The square root of 133526881 is about 11555.3832043771. The cubic root of 133526881 is about 511.1200310860.
The spelling of 133526881 in words is "one hundred thirty-three million, five hundred twenty-six thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •