Base | Representation |
---|---|
bin | 1011110000111101101… |
… | …0101100111110010101 |
3 | 201022201020102121101112 |
4 | 2330033122230332111 |
5 | 11302421230333414 |
6 | 232504214304405 |
7 | 20413526453006 |
oct | 2741732547625 |
9 | 638636377345 |
10 | 202122121109 |
11 | 787a07391a7 |
12 | 3320a358105 |
13 | 160a1b83a3c |
14 | 9ad5c891ad |
15 | 53ce90ad3e |
hex | 2f0f6acf95 |
202122121109 has 4 divisors (see below), whose sum is σ = 202258048704. Its totient is φ = 201986193516.
The previous prime is 202122121057. The next prime is 202122121133. The reversal of 202122121109 is 901121221202.
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, and also an emirpimes, since its reverse is a distinct semiprime: 901121221202 = 2 ⋅450560610601.
It is a cyclic number.
It is not a de Polignac number, because 202122121109 - 28 = 202122120853 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 (202122121139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67961567 + ... + 67964540.
It is an arithmetic number, because the mean of its divisors is an integer number (50564512176).
Almost surely, 2202122121109 is an apocalyptic number.
It is an amenable number.
202122121109 is a deficient number, since it is larger than the sum of its proper divisors (135927595).
202122121109 is a wasteful number, since it uses less digits than its factorization.
202122121109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135927594.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 202122121109 in words is "two hundred two billion, one hundred twenty-two million, one hundred twenty-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •