Base | Representation |
---|---|
bin | 1011110001010011001… |
… | …0000100100100001101 |
3 | 201022221111210200200012 |
4 | 2330110302010210031 |
5 | 11303112301230013 |
6 | 232521151443005 |
7 | 20416001525513 |
oct | 2742462044415 |
9 | 638844720605 |
10 | 202212133133 |
11 | 788375285aa |
12 | 33234526465 |
13 | 160b770b2aa |
14 | 9b03bda4b3 |
15 | 53d778b1a8 |
hex | 2f14c8490d |
202212133133 has 16 divisors (see below), whose sum is σ = 212095327920. Its totient is φ = 192524097024.
The previous prime is 202212133111. The next prime is 202212133139. The reversal of 202212133133 is 331331212202.
It can be written as a sum of positive squares in 8 ways, for example, as 27369400969 + 174842732164 = 165437^2 + 418142^2 .
It is a cyclic number.
It is not a de Polignac number, because 202212133133 - 28 = 202212132877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202212133099 and 202212133108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202212133139) 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, 16025735 + ... + 16038347.
It is an arithmetic number, because the mean of its divisors is an integer number (13255957995).
Almost surely, 2202212133133 is an apocalyptic number.
It is an amenable number.
202212133133 is a deficient number, since it is larger than the sum of its proper divisors (9883194787).
202212133133 is a wasteful number, since it uses less digits than its factorization.
202212133133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20288.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 202212133133 its reverse (331331212202), we get a palindrome (533543345335).
The spelling of 202212133133 in words is "two hundred two billion, two hundred twelve million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •