Base | Representation |
---|---|
bin | 11110010010011111100010… |
… | …100101101000101101000111 |
3 | 122110122222000002222101220122 |
4 | 132102133202211220231013 |
5 | 114430022102310433221 |
6 | 1151152502341252155 |
7 | 40026156542005124 |
oct | 3622374245505507 |
9 | 573588002871818 |
10 | 133212212202311 |
11 | 39499a88a53490 |
12 | 12b3550440405b |
13 | 5943b1c506168 |
14 | 24c771103174b |
15 | 106024e44beab |
hex | 7927e2968b47 |
133212212202311 has 16 divisors (see below), whose sum is σ = 146218472533248. Its totient is φ = 120355340918400.
The previous prime is 133212212202283. The next prime is 133212212202371. The reversal of 133212212202311 is 113202212212331.
It is a cyclic number.
It is not a de Polignac number, because 133212212202311 - 26 = 133212212202247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133212212202371) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57836831 + ... + 60095951.
It is an arithmetic number, because the mean of its divisors is an integer number (9138654533328).
Almost surely, 2133212212202311 is an apocalyptic number.
133212212202311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133212212202311 is a deficient number, since it is larger than the sum of its proper divisors (13006260330937).
133212212202311 is a wasteful number, since it uses less digits than its factorization.
133212212202311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2292182.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 133212212202311 its reverse (113202212212331), we get a palindrome (246414424414642).
The spelling of 133212212202311 in words is "one hundred thirty-three trillion, two hundred twelve billion, two hundred twelve million, two hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •