Base | Representation |
---|---|
bin | 1111111010100… |
… | …11110101111010 |
3 | 100022020010211000 |
4 | 13331103311322 |
5 | 233134400240 |
6 | 21125345430 |
7 | 3210560322 |
oct | 775236572 |
9 | 308203730 |
10 | 133512570 |
11 | 69400a74 |
12 | 38868276 |
13 | 21878529 |
14 | 13a36282 |
15 | bac4430 |
hex | 7f53d7a |
133512570 has 64 divisors (see below), whose sum is σ = 357696000. Its totient is φ = 35437248.
The previous prime is 133512569. The next prime is 133512583. The reversal of 133512570 is 75215331.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 63496 + ... + 65564.
It is an arithmetic number, because the mean of its divisors is an integer number (5589000).
Almost surely, 2133512570 is an apocalyptic number.
133512570 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 133512570, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178848000).
133512570 is an abundant number, since it is smaller than the sum of its proper divisors (224183430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133512570 is a wasteful number, since it uses less digits than its factorization.
133512570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2324 (or 2318 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 27.
The square root of 133512570 is about 11554.7639525868. The cubic root of 133512570 is about 511.1017703432.
The spelling of 133512570 in words is "one hundred thirty-three million, five hundred twelve thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •