Base | Representation |
---|---|
bin | 1001001100010010000011… |
… | …11011000111010000000101 |
3 | 2122120100212012110222112211 |
4 | 10212021001323013100011 |
5 | 10122133134330011323 |
6 | 110553454231543421 |
7 | 4154233326036106 |
oct | 446110173072005 |
9 | 78510765428484 |
10 | 20213222110213 |
11 | 6493419a18350 |
12 | 232555b22ab71 |
13 | b38138a00962 |
14 | 4dc47a3a43ad |
15 | 250bd3ed270d |
hex | 126241ec7405 |
20213222110213 has 4 divisors (see below), whose sum is σ = 22050787756608. Its totient is φ = 18375656463820.
The previous prime is 20213222110153. The next prime is 20213222110223. The reversal of 20213222110213 is 31201122231202.
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 20213222110213 - 217 = 20213221979141 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 (20213222110223) 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, 918782823181 + ... + 918782823202.
It is an arithmetic number, because the mean of its divisors is an integer number (5512696939152).
Almost surely, 220213222110213 is an apocalyptic number.
It is an amenable number.
20213222110213 is a deficient number, since it is larger than the sum of its proper divisors (1837565646395).
20213222110213 is a wasteful number, since it uses less digits than its factorization.
20213222110213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1837565646394.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 20213222110213 its reverse (31201122231202), we get a palindrome (51414344341415).
The spelling of 20213222110213 in words is "twenty trillion, two hundred thirteen billion, two hundred twenty-two million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •