Base | Representation |
---|---|
bin | 111101111111001011… |
… | …0000100010000001101 |
3 | 110201121002122102210120 |
4 | 1323332112010100031 |
5 | 4140110222410313 |
6 | 141052554255153 |
7 | 12421513112112 |
oct | 1737626042015 |
9 | 421532572716 |
10 | 133116216333 |
11 | 514aa6a7631 |
12 | 219704274b9 |
13 | c725689a19 |
14 | 662b2c4909 |
15 | 36e1711d23 |
hex | 1efe58440d |
133116216333 has 8 divisors (see below), whose sum is σ = 180137367648. Its totient is φ = 87419604624.
The previous prime is 133116216307. The next prime is 133116216371. The reversal of 133116216333 is 333612611331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133116216333 - 29 = 133116215821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133116216294 and 133116216303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133116266333) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 331134666 + ... + 331135067.
It is an arithmetic number, because the mean of its divisors is an integer number (22517170956).
Almost surely, 2133116216333 is an apocalyptic number.
It is an amenable number.
133116216333 is a deficient number, since it is larger than the sum of its proper divisors (47021151315).
133116216333 is an equidigital number, since it uses as much as digits as its factorization.
133116216333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662269803.
The product of its digits is 17496, while the sum is 33.
Adding to 133116216333 its reverse (333612611331), we get a palindrome (466728827664).
The spelling of 133116216333 in words is "one hundred thirty-three billion, one hundred sixteen million, two hundred sixteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •