Base | Representation |
---|---|
bin | 1111111011010… |
… | …01100110111101 |
3 | 100022101200010001 |
4 | 13331221212331 |
5 | 233200223400 |
6 | 21131314301 |
7 | 3211411255 |
oct | 775514675 |
9 | 308350101 |
10 | 133601725 |
11 | 69461a54 |
12 | 388ab991 |
13 | 218a9c9a |
14 | 13a5a965 |
15 | bae0a6a |
hex | 7f699bd |
133601725 has 12 divisors (see below), whose sum is σ = 175411764. Its totient is φ = 100593920.
The previous prime is 133601701. The next prime is 133601729. The reversal of 133601725 is 527106331.
It can be written as a sum of positive squares in 6 ways, for example, as 6859161 + 126742564 = 2619^2 + 11258^2 .
It is not a de Polignac number, because 133601725 - 213 = 133593533 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133601693 and 133601702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133601729) 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 11 ways as a sum of consecutive naturals, for example, 156754 + ... + 157603.
It is an arithmetic number, because the mean of its divisors is an integer number (14617647).
Almost surely, 2133601725 is an apocalyptic number.
It is an amenable number.
133601725 is a deficient number, since it is larger than the sum of its proper divisors (41810039).
133601725 is a wasteful number, since it uses less digits than its factorization.
133601725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314384 (or 314379 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 28.
The square root of 133601725 is about 11558.6212413073. The cubic root of 133601725 is about 511.2155102938.
The spelling of 133601725 in words is "one hundred thirty-three million, six hundred one thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •