Base | Representation |
---|---|
bin | 1111110110111… |
… | …10111010011001 |
3 | 100021022210211022 |
4 | 13323132322121 |
5 | 233024034000 |
6 | 21111212225 |
7 | 3203524064 |
oct | 773367231 |
9 | 307283738 |
10 | 133033625 |
11 | 6910414a |
12 | 38677075 |
13 | 2173b52a |
14 | 1394d8db |
15 | ba2c585 |
hex | 7edee99 |
133033625 has 8 divisors (see below), whose sum is σ = 166026120. Its totient is φ = 106426800.
The previous prime is 133033597. The next prime is 133033627. The reversal of 133033625 is 526330331.
It can be written as a sum of positive squares in 4 ways, for example, as 4596736 + 128436889 = 2144^2 + 11333^2 .
It is not a de Polignac number, because 133033625 - 212 = 133029529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133033594 and 133033603.
It is not an unprimeable number, because it can be changed into a prime (133033627) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 532010 + ... + 532259.
It is an arithmetic number, because the mean of its divisors is an integer number (20753265).
Almost surely, 2133033625 is an apocalyptic number.
It is an amenable number.
133033625 is a deficient number, since it is larger than the sum of its proper divisors (32992495).
133033625 is an equidigital number, since it uses as much as digits as its factorization.
133033625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1064284 (or 1064274 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 26.
The square root of 133033625 is about 11534.0203311768. The cubic root of 133033625 is about 510.4898855581.
Adding to 133033625 its reverse (526330331), we get a palindrome (659363956).
The spelling of 133033625 in words is "one hundred thirty-three million, thirty-three thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •