Base | Representation |
---|---|
bin | 10010110000000010… |
… | …001000111101110101 |
3 | 1220222010012120000201 |
4 | 102300002020331311 |
5 | 312213101021323 |
6 | 13125444440501 |
7 | 1311630356011 |
oct | 226002107565 |
9 | 56863176021 |
10 | 20133220213 |
11 | 85a1750377 |
12 | 3a9a6a9131 |
13 | 1b8b180072 |
14 | d8dc83541 |
15 | 7cc7d38ad |
hex | 4b0088f75 |
20133220213 has 4 divisors (see below), whose sum is σ = 20134177420. Its totient is φ = 20132263008.
The previous prime is 20133220193. The next prime is 20133220267. The reversal of 20133220213 is 31202233102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3738466449 + 16394753764 = 61143^2 + 128042^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20133220213 is a prime.
It is a super-2 number, since 2×201332202132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20133220313) 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, 446328 + ... + 489361.
It is an arithmetic number, because the mean of its divisors is an integer number (5033544355).
Almost surely, 220133220213 is an apocalyptic number.
It is an amenable number.
20133220213 is a deficient number, since it is larger than the sum of its proper divisors (957207).
20133220213 is an equidigital number, since it uses as much as digits as its factorization.
20133220213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 957206.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 20133220213 its reverse (31202233102), we get a palindrome (51335453315).
The spelling of 20133220213 in words is "twenty billion, one hundred thirty-three million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •