Base | Representation |
---|---|
bin | 1011110000100011001… |
… | …0111001011101110101 |
3 | 201022102111101020201221 |
4 | 2330020302321131311 |
5 | 11302204310220341 |
6 | 232445205150341 |
7 | 20411010236320 |
oct | 2741062713565 |
9 | 638374336657 |
10 | 202011023221 |
11 | 78743a57767 |
12 | 331990bb3b1 |
13 | 16084b55a47 |
14 | 9ac52097b7 |
15 | 53c4cb2ed1 |
hex | 2f08cb9775 |
202011023221 has 4 divisors (see below), whose sum is σ = 230869740832. Its totient is φ = 173152305612.
The previous prime is 202011023213. The next prime is 202011023231. The reversal of 202011023221 is 122320110202.
It is a happy number.
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 202011023221 - 23 = 202011023213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202011023195 and 202011023204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202011023231) 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, 14429358795 + ... + 14429358808.
It is an arithmetic number, because the mean of its divisors is an integer number (57717435208).
Almost surely, 2202011023221 is an apocalyptic number.
It is an amenable number.
202011023221 is a deficient number, since it is larger than the sum of its proper divisors (28858717611).
202011023221 is an equidigital number, since it uses as much as digits as its factorization.
202011023221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28858717610.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 202011023221 its reverse (122320110202), we get a palindrome (324331133423).
The spelling of 202011023221 in words is "two hundred two billion, eleven million, twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •