Base | Representation |
---|---|
bin | 1111110110110… |
… | …10010110110000 |
3 | 100021021212020000 |
4 | 13323122112300 |
5 | 233022434320 |
6 | 21110550000 |
7 | 3203415501 |
oct | 773322660 |
9 | 307255200 |
10 | 133014960 |
11 | 690a1121 |
12 | 38668300 |
13 | 21732ba0 |
14 | 13946ba8 |
15 | ba26c90 |
hex | 7eda5b0 |
133014960 has 200 divisors, whose sum is σ = 497832720. Its totient is φ = 32721408.
The previous prime is 133014941. The next prime is 133014961. The reversal of 133014960 is 69410331.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (133014961) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 83451 + ... + 85029.
Almost surely, 2133014960 is an apocalyptic number.
133014960 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 133014960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (248916360).
133014960 is an abundant number, since it is smaller than the sum of its proper divisors (364817760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133014960 is a wasteful number, since it uses less digits than its factorization.
133014960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1617 (or 1602 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
The square root of 133014960 is about 11533.2111746902. The cubic root of 133014960 is about 510.4660100420.
It can be divided in two parts, 1330 and 14960, that added together give a triangular number (16290 = T180).
The spelling of 133014960 in words is "one hundred thirty-three million, fourteen thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •