Base | Representation |
---|---|
bin | 1111111100011… |
… | …10000110100000 |
3 | 100022200021011011 |
4 | 13332032012200 |
5 | 233220014300 |
6 | 21134430304 |
7 | 3212603122 |
oct | 776160640 |
9 | 308607134 |
10 | 133751200 |
11 | 69554290 |
12 | 38962394 |
13 | 2193002b |
14 | 13a99212 |
15 | bb1eeba |
hex | 7f8e1a0 |
133751200 has 72 divisors (see below), whose sum is σ = 356227200. Its totient is φ = 48633600.
The previous prime is 133751197. The next prime is 133751201. The reversal of 133751200 is 2157331.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (133751201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1201 + ... + 16399.
It is an arithmetic number, because the mean of its divisors is an integer number (4947600).
Almost surely, 2133751200 is an apocalyptic number.
133751200 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 133751200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178113600).
133751200 is an abundant number, since it is smaller than the sum of its proper divisors (222476000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133751200 is a wasteful number, since it uses less digits than its factorization.
133751200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15230 (or 15217 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 22.
The square root of 133751200 is about 11565.0853866282. The cubic root of 133751200 is about 511.4060903145.
The spelling of 133751200 in words is "one hundred thirty-three million, seven hundred fifty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •