Base | Representation |
---|---|
bin | 1011101101100010010… |
… | …0110011001011111101 |
3 | 201020100010002200111001 |
4 | 2323120210303023331 |
5 | 11244030204133432 |
6 | 232233025330301 |
7 | 20351654650516 |
oct | 2733044631375 |
9 | 636303080431 |
10 | 201202021117 |
11 | 78369328489 |
12 | 32bb2196991 |
13 | 15c86370586 |
14 | 9a499b9a0d |
15 | 5378c5d9e7 |
hex | 2ed89332fd |
201202021117 has 2 divisors, whose sum is σ = 201202021118. Its totient is φ = 201202021116.
The previous prime is 201202021109. The next prime is 201202021157. The reversal of 201202021117 is 711120202102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 182624603716 + 18577417401 = 427346^2 + 136299^2 .
It is a cyclic number.
It is not a de Polignac number, because 201202021117 - 23 = 201202021109 is a prime.
It is a super-3 number, since 3×2012020211173 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201202021094 and 201202021103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201202021157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100601010558 + 100601010559.
It is an arithmetic number, because the mean of its divisors is an integer number (100601010559).
Almost surely, 2201202021117 is an apocalyptic number.
It is an amenable number.
201202021117 is a deficient number, since it is larger than the sum of its proper divisors (1).
201202021117 is an equidigital number, since it uses as much as digits as its factorization.
201202021117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 19.
Adding to 201202021117 its reverse (711120202102), we get a palindrome (912322223219).
The spelling of 201202021117 in words is "two hundred one billion, two hundred two million, twenty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •