Base | Representation |
---|---|
bin | 11000000110101… |
… | …01101111110101 |
3 | 112002110221010201 |
4 | 30003111233311 |
5 | 403230431401 |
6 | 32021520501 |
7 | 5003455333 |
oct | 1403255765 |
9 | 462427121 |
10 | 202202101 |
11 | a4157482 |
12 | 57873131 |
13 | 32b7871a |
14 | 1cbd6b53 |
15 | 12b41b01 |
hex | c0d5bf5 |
202202101 has 4 divisors (see below), whose sum is σ = 204204204. Its totient is φ = 200200000.
The previous prime is 202202059. The next prime is 202202111. The reversal of 202202101 is 101202202.
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 81180100 + 121022001 = 9010^2 + 11001^2 .
It is a cyclic number.
It is not a de Polignac number, because 202202101 - 29 = 202201589 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 (202202111) 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, 1000900 + ... + 1001101.
It is an arithmetic number, because the mean of its divisors is an integer number (51051051).
Almost surely, 2202202101 is an apocalyptic number.
It is an amenable number.
202202101 is a deficient number, since it is larger than the sum of its proper divisors (2002103).
202202101 is a wasteful number, since it uses less digits than its factorization.
202202101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2002102.
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 202202101 is about 14219.7785144495. The cubic root of 202202101 is about 586.9420455559.
Adding to 202202101 its reverse (101202202), we get a palindrome (303404303).
It can be divided in two parts, 202202 and 101, that multiplied together give a palindrome (20422402).
The spelling of 202202101 in words is "two hundred two million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •