Base | Representation |
---|---|
bin | 1111110110110… |
… | …01101010001110 |
3 | 100021021201022110 |
4 | 13323121222032 |
5 | 233022341420 |
6 | 21110524450 |
7 | 3203404260 |
oct | 773315216 |
9 | 307251273 |
10 | 133012110 |
11 | 69099a70 |
12 | 38666726 |
13 | 217317ba |
14 | 13945b30 |
15 | ba25ee0 |
hex | 7ed9a8e |
133012110 has 128 divisors (see below), whose sum is σ = 404103168. Its totient is φ = 27216000.
The previous prime is 133012093. The next prime is 133012133. The reversal of 133012110 is 11210331.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 163605 + ... + 164415.
It is an arithmetic number, because the mean of its divisors is an integer number (3157056).
Almost surely, 2133012110 is an apocalyptic number.
133012110 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 133012110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (202051584).
133012110 is an abundant number, since it is smaller than the sum of its proper divisors (271091058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133012110 is a wasteful number, since it uses less digits than its factorization.
133012110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 910.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 133012110 is about 11533.0876178064. The cubic root of 133012110 is about 510.4623642403.
Adding to 133012110 its reverse (11210331), we get a palindrome (144222441).
The spelling of 133012110 in words is "one hundred thirty-three million, twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •