Base | Representation |
---|---|
bin | 101101111101000110101110… |
… | …011010011110000001111001 |
3 | 222111121122100012002002201202 |
4 | 231331012232122132001321 |
5 | 202442342220232102301 |
6 | 1553504334324023545 |
7 | 60400024001155166 |
oct | 5575065632360171 |
9 | 874548305062652 |
10 | 202111202222201 |
11 | 59442974698608 |
12 | 1a802608831bb5 |
13 | 88a100a111c1c |
14 | 37ca33d20506d |
15 | 185759998d66b |
hex | b7d1ae69e079 |
202111202222201 has 8 divisors (see below), whose sum is σ = 205580737084800. Its totient is φ = 198670460180400.
The previous prime is 202111202222197. The next prime is 202111202222221. The reversal of 202111202222201 is 102222202111202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 202111202222201 - 22 = 202111202222197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (202111202222221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7198191041 + ... + 7198219118.
It is an arithmetic number, because the mean of its divisors is an integer number (25697592135600).
Almost surely, 2202111202222201 is an apocalyptic number.
It is an amenable number.
202111202222201 is a deficient number, since it is larger than the sum of its proper divisors (3469534862599).
202111202222201 is a wasteful number, since it uses less digits than its factorization.
202111202222201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14396410399.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 202111202222201 its reverse (102222202111202), we get a palindrome (304333404333403).
The spelling of 202111202222201 in words is "two hundred two trillion, one hundred eleven billion, two hundred two million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •