Base | Representation |
---|---|
bin | 1111110111001… |
… | …01111010111010 |
3 | 100021101021012110 |
4 | 13323211322322 |
5 | 233030443310 |
6 | 21111553150 |
7 | 3204003552 |
oct | 773457272 |
9 | 307337173 |
10 | 133062330 |
11 | 69123775 |
12 | 3868b7b6 |
13 | 2174b60b |
14 | 1395a162 |
15 | ba35d20 |
hex | 7ee5eba |
133062330 has 48 divisors (see below), whose sum is σ = 325694880. Its totient is φ = 34791744.
The previous prime is 133062317. The next prime is 133062341. The reversal of 133062330 is 33260331.
It is a junction number, because it is equal to n+sod(n) for n = 133062297 and 133062306.
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 23 ways as a sum of consecutive naturals, for example, 83481 + ... + 85059.
It is an arithmetic number, because the mean of its divisors is an integer number (6785310).
Almost surely, 2133062330 is an apocalyptic number.
133062330 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 133062330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162847440).
133062330 is an abundant number, since it is smaller than the sum of its proper divisors (192632550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133062330 is a wasteful number, since it uses less digits than its factorization.
133062330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1695 (or 1642 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
The square root of 133062330 is about 11535.2646263534. The cubic root of 133062330 is about 510.5265994800.
The spelling of 133062330 in words is "one hundred thirty-three million, sixty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •