Base | Representation |
---|---|
bin | 101101111011100000010010… |
… | …011111111010101010001101 |
3 | 222111020010102210111011122001 |
4 | 231323200102133322222031 |
5 | 202434041440312101333 |
6 | 1553342024212352301 |
7 | 60356051230454014 |
oct | 5573402237725215 |
9 | 874203383434561 |
10 | 202001212222093 |
11 | 59400262158579 |
12 | 1a7a5231315691 |
13 | 889382ba0681b |
14 | 37c4ca74a5a7b |
15 | 18547ad6bdb7d |
hex | b7b8127faa8d |
202001212222093 has 2 divisors, whose sum is σ = 202001212222094. Its totient is φ = 202001212222092.
The previous prime is 202001212222091. The next prime is 202001212222151. The reversal of 202001212222093 is 390222212100202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 152403518613124 + 49597693608969 = 12345182^2 + 7042563^2 .
It is a cyclic number.
It is not a de Polignac number, because 202001212222093 - 21 = 202001212222091 is a prime.
Together with 202001212222091, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202001212222091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101000606111046 + 101000606111047.
It is an arithmetic number, because the mean of its divisors is an integer number (101000606111047).
Almost surely, 2202001212222093 is an apocalyptic number.
It is an amenable number.
202001212222093 is a deficient number, since it is larger than the sum of its proper divisors (1).
202001212222093 is an equidigital number, since it uses as much as digits as its factorization.
202001212222093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 202001212222093 its reverse (390222212100202), we get a palindrome (592223424322295).
The spelling of 202001212222093 in words is "two hundred two trillion, one billion, two hundred twelve million, two hundred twenty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •