Base | Representation |
---|---|
bin | 1111111000101… |
… | …00100010110100 |
3 | 100021201222011102 |
4 | 13330110202310 |
5 | 233103101200 |
6 | 21120025232 |
7 | 3205430405 |
oct | 774244264 |
9 | 307658142 |
10 | 133253300 |
11 | 692441a4 |
12 | 38762218 |
13 | 217b750b |
14 | 139a99ac |
15 | ba726d5 |
hex | 7f148b4 |
133253300 has 36 divisors (see below), whose sum is σ = 289731456. Its totient is φ = 53196000.
The previous prime is 133253287. The next prime is 133253303. The reversal of 133253300 is 3352331.
133253300 is digitally balanced in base 3 and base 9, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
133253300 is strictly pandigital in base 9.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133253303) 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, 67325 + ... + 69275.
It is an arithmetic number, because the mean of its divisors is an integer number (8048096).
Almost surely, 2133253300 is an apocalyptic number.
133253300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133253300 is an abundant number, since it is smaller than the sum of its proper divisors (156478156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133253300 is a wasteful number, since it uses less digits than its factorization.
133253300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2648 (or 2641 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 20.
The square root of 133253300 is about 11543.5393185972. The cubic root of 133253300 is about 510.7707173065.
The spelling of 133253300 in words is "one hundred thirty-three million, two hundred fifty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •