Base | Representation |
---|---|
bin | 1111111000101… |
… | …01010110101100 |
3 | 100021202010201101 |
4 | 13330111112230 |
5 | 233103202440 |
6 | 21120052444 |
7 | 3205443160 |
oct | 774252654 |
9 | 307663641 |
10 | 133256620 |
11 | 69246742 |
12 | 38764124 |
13 | 217b8b93 |
14 | 139aaca0 |
15 | ba7369a |
hex | 7f155ac |
133256620 has 48 divisors (see below), whose sum is σ = 320943168. Its totient is φ = 45527040.
The previous prime is 133256611. The next prime is 133256621. The reversal of 133256620 is 26652331.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (133256621) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42300 + ... + 45340.
It is an arithmetic number, because the mean of its divisors is an integer number (6686316).
Almost surely, 2133256620 is an apocalyptic number.
133256620 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 133256620, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160471584).
133256620 is an abundant number, since it is smaller than the sum of its proper divisors (187686548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133256620 is a wasteful number, since it uses less digits than its factorization.
133256620 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3370 (or 3368 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 133256620 is about 11543.6831210840. The cubic root of 133256620 is about 510.7749592145.
The spelling of 133256620 in words is "one hundred thirty-three million, two hundred fifty-six thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •