Base | Representation |
---|---|
bin | 1001001011111101100011… |
… | …01100001000101010010101 |
3 | 2122112022102220122012120020 |
4 | 10211332301230020222111 |
5 | 10121443112324031013 |
6 | 110544433534055353 |
7 | 4153363440330651 |
oct | 445766154105225 |
9 | 78468386565506 |
10 | 20202212330133 |
11 | 648978a20a649 |
12 | 23233a804a559 |
13 | b370a2a608a2 |
14 | 4dbb140a9a61 |
15 | 25078c660623 |
hex | 125fb1b08a95 |
20202212330133 has 4 divisors (see below), whose sum is σ = 26936283106848. Its totient is φ = 13468141553420.
The previous prime is 20202212330123. The next prime is 20202212330171. The reversal of 20202212330133 is 33103321220202.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20202212330133 - 25 = 20202212330101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20202212330123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3367035388353 + ... + 3367035388358.
It is an arithmetic number, because the mean of its divisors is an integer number (6734070776712).
Almost surely, 220202212330133 is an apocalyptic number.
It is an amenable number.
20202212330133 is a deficient number, since it is larger than the sum of its proper divisors (6734070776715).
20202212330133 is an equidigital number, since it uses as much as digits as its factorization.
20202212330133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6734070776714.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 20202212330133 its reverse (33103321220202), we get a palindrome (53305533550335).
The spelling of 20202212330133 in words is "twenty trillion, two hundred two billion, two hundred twelve million, three hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •