Base | Representation |
---|---|
bin | 1111111001000… |
… | …00001100100100 |
3 | 100021211101122010 |
4 | 13330200030210 |
5 | 233111113103 |
6 | 21121034220 |
7 | 3206016510 |
oct | 774401444 |
9 | 307741563 |
10 | 133301028 |
11 | 69277043 |
12 | 38785970 |
13 | 21803163 |
14 | 139bd140 |
15 | ba81903 |
hex | 7f20324 |
133301028 has 48 divisors (see below), whose sum is σ = 358815744. Its totient is φ = 37727520.
The previous prime is 133301011. The next prime is 133301053. The reversal of 133301028 is 820103331.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 133300995 and 133301013.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1573 + ... + 16403.
It is an arithmetic number, because the mean of its divisors is an integer number (7475328).
Almost surely, 2133301028 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 133301028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179407872).
133301028 is an abundant number, since it is smaller than the sum of its proper divisors (225514716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133301028 is a wasteful number, since it uses less digits than its factorization.
133301028 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14952 (or 14950 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 133301028 is about 11545.6064370825. The cubic root of 133301028 is about 510.8316917936.
Adding to 133301028 its reverse (820103331), we get a palindrome (953404359).
The spelling of 133301028 in words is "one hundred thirty-three million, three hundred one thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •