Base | Representation |
---|---|
bin | 111101111111000011… |
… | …0110010101011101001 |
3 | 110201120211010000011101 |
4 | 1323332012302223221 |
5 | 4140103211242301 |
6 | 141052332401401 |
7 | 12421434064213 |
oct | 1737606625351 |
9 | 421524100141 |
10 | 133112212201 |
11 | 514a8412231 |
12 | 2196b016261 |
13 | c7248b7307 |
14 | 662a9615b3 |
15 | 36e11c0701 |
hex | 1efe1b2ae9 |
133112212201 has 8 divisors (see below), whose sum is σ = 138904058304. Its totient is φ = 127320729360.
The previous prime is 133112212187. The next prime is 133112212223. The reversal of 133112212201 is 102212211331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133112212201 - 229 = 132575341289 is a prime.
It is a super-2 number, since 2×1331122122012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133112212901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 878031 + ... + 1018411.
It is an arithmetic number, because the mean of its divisors is an integer number (17363007288).
Almost surely, 2133112212201 is an apocalyptic number.
It is an amenable number.
133112212201 is a deficient number, since it is larger than the sum of its proper divisors (5791846103).
133112212201 is a wasteful number, since it uses less digits than its factorization.
133112212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181631.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 133112212201 its reverse (102212211331), we get a palindrome (235324423532).
The spelling of 133112212201 in words is "one hundred thirty-three billion, one hundred twelve million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •