Base | Representation |
---|---|
bin | 1111111000100… |
… | …11110111100101 |
3 | 100021201211100221 |
4 | 13330103313211 |
5 | 233103004113 |
6 | 21120004341 |
7 | 3205416343 |
oct | 774236745 |
9 | 307654327 |
10 | 133250533 |
11 | 69242109 |
12 | 387606b1 |
13 | 217b6190 |
14 | 139a8993 |
15 | ba7198d |
hex | 7f13de5 |
133250533 has 24 divisors (see below), whose sum is σ = 151509960. Its totient is φ = 116413440.
The previous prime is 133250531. The next prime is 133250561. The reversal of 133250533 is 335052331.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 69522244 + 63728289 = 8338^2 + 7983^2 .
It is not a de Polignac number, because 133250533 - 21 = 133250531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133250498 and 133250507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133250531) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1497153 + ... + 1497241.
It is an arithmetic number, because the mean of its divisors is an integer number (6312915).
Almost surely, 2133250533 is an apocalyptic number.
133250533 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
133250533 is a deficient number, since it is larger than the sum of its proper divisors (18259427).
133250533 is an equidigital number, since it uses as much as digits as its factorization.
133250533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249 (or 196 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 25.
The square root of 133250533 is about 11543.4194673849. The cubic root of 133250533 is about 510.7671819035.
The spelling of 133250533 in words is "one hundred thirty-three million, two hundred fifty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •