Base | Representation |
---|---|
bin | 111101111100000000… |
… | …1011000010010111110 |
3 | 110201022201000200212012 |
4 | 1323320001120102332 |
5 | 4134401043130420 |
6 | 141034244411222 |
7 | 12416054310614 |
oct | 1737001302276 |
9 | 421281020765 |
10 | 133010130110 |
11 | 51455829470 |
12 | 219409a6b12 |
13 | c7096c4c00 |
14 | 661b18b6b4 |
15 | 36d7258dc5 |
hex | 1ef80584be |
133010130110 has 48 divisors (see below), whose sum is σ = 282820073040. Its totient is φ = 44646750720.
The previous prime is 133010130109. The next prime is 133010130199. The reversal of 133010130110 is 11031010331.
It is a happy number.
It is a super-2 number, since 2×1330101301102 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
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, 3558875 + ... + 3596054.
It is an arithmetic number, because the mean of its divisors is an integer number (5892084855).
Almost surely, 2133010130110 is an apocalyptic number.
133010130110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133010130110 is an abundant number, since it is smaller than the sum of its proper divisors (149809942930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133010130110 is a wasteful number, since it uses less digits than its factorization.
133010130110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7154973 (or 7154960 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 133010130110 its reverse (11031010331), we get a palindrome (144041140441).
The spelling of 133010130110 in words is "one hundred thirty-three billion, ten million, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •