Base | Representation |
---|---|
bin | 1011110100100111000… |
… | …1101011010101001101 |
3 | 201102020110210002121200 |
4 | 2331021301223111031 |
5 | 11311422403102341 |
6 | 233145312020113 |
7 | 20450015622132 |
oct | 2751161532515 |
9 | 642213702550 |
10 | 203101222221 |
11 | 79153388377 |
12 | 33442231639 |
13 | 161c9984601 |
14 | 9b89d16589 |
15 | 543a85edb6 |
hex | 2f49c6b54d |
203101222221 has 12 divisors (see below), whose sum is σ = 293804352348. Its totient is φ = 135199620864.
The previous prime is 203101222217. The next prime is 203101222241. The reversal of 203101222221 is 122222101302.
It can be written as a sum of positive squares in 2 ways, for example, as 115848333225 + 87252888996 = 340365^2 + 295386^2 .
It is not a de Polignac number, because 203101222221 - 22 = 203101222217 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 203101222194 and 203101222203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203101222241) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16759770 + ... + 16771883.
It is an arithmetic number, because the mean of its divisors is an integer number (24483696029).
Almost surely, 2203101222221 is an apocalyptic number.
It is an amenable number.
203101222221 is a deficient number, since it is larger than the sum of its proper divisors (90703130127).
203101222221 is a wasteful number, since it uses less digits than its factorization.
203101222221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33532332 (or 33532329 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 203101222221 its reverse (122222101302), we get a palindrome (325323323523).
The spelling of 203101222221 in words is "two hundred three billion, one hundred one million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •