Base | Representation |
---|---|
bin | 1111111000100… |
… | …00101000001101 |
3 | 100021201011011101 |
4 | 13330100220031 |
5 | 233102043021 |
6 | 21115423101 |
7 | 3205332553 |
oct | 774205015 |
9 | 307634141 |
10 | 133237261 |
11 | 69233143 |
12 | 38754a91 |
13 | 217b0121 |
14 | 139a3bd3 |
15 | ba6ca91 |
hex | 7f10a0d |
133237261 has 4 divisors (see below), whose sum is σ = 133289500. Its totient is φ = 133185024.
The previous prime is 133237231. The next prime is 133237271. The reversal of 133237261 is 162732331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 52345225 + 80892036 = 7235^2 + 8994^2 .
It is a cyclic number.
It is not a de Polignac number, because 133237261 - 217 = 133106189 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 (133237231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22086 + ... + 27463.
It is an arithmetic number, because the mean of its divisors is an integer number (33322375).
Almost surely, 2133237261 is an apocalyptic number.
It is an amenable number.
133237261 is a deficient number, since it is larger than the sum of its proper divisors (52239).
133237261 is an equidigital number, since it uses as much as digits as its factorization.
133237261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52238.
The product of its digits is 4536, while the sum is 28.
The square root of 133237261 is about 11542.8445800851. The cubic root of 133237261 is about 510.7502235545.
Adding to 133237261 its reverse (162732331), we get a palindrome (295969592).
The spelling of 133237261 in words is "one hundred thirty-three million, two hundred thirty-seven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •