Base | Representation |
---|---|
bin | 1111111010100… |
… | …10001100111010 |
3 | 100022012210121010 |
4 | 13331102030322 |
5 | 233134141400 |
6 | 21125254350 |
7 | 3210531612 |
oct | 775221472 |
9 | 308183533 |
10 | 133505850 |
11 | 693a6a15 |
12 | 388643b6 |
13 | 2187545a |
14 | 13a33a42 |
15 | bac2450 |
hex | 7f5233a |
133505850 has 96 divisors (see below), whose sum is σ = 350334720. Its totient is φ = 33591040.
The previous prime is 133505807. The next prime is 133505851. The reversal of 133505850 is 58505331.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (133505851) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 204124 + ... + 204776.
It is an arithmetic number, because the mean of its divisors is an integer number (3649320).
Almost surely, 2133505850 is an apocalyptic number.
133505850 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 133505850, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175167360).
133505850 is an abundant number, since it is smaller than the sum of its proper divisors (216828870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133505850 is a wasteful number, since it uses less digits than its factorization.
133505850 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 744 (or 739 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
The square root of 133505850 is about 11554.4731597767. The cubic root of 133505850 is about 511.0931952167.
The spelling of 133505850 in words is "one hundred thirty-three million, five hundred five thousand, eight hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •