Base | Representation |
---|---|
bin | 101101110000001000110101… |
… | …110010010111001100000011 |
3 | 222101110110022011001211222022 |
4 | 231300020311302113030003 |
5 | 202333242301233242402 |
6 | 1551543125212032055 |
7 | 60245450106101444 |
oct | 5560106562271403 |
9 | 871413264054868 |
10 | 201220120212227 |
11 | 59129a79075706 |
12 | 1a69998316262b |
13 | 8837c8c120bbc |
14 | 379916a3a72cb |
15 | 183e2e533e2a2 |
hex | b70235c97303 |
201220120212227 has 2 divisors, whose sum is σ = 201220120212228. Its totient is φ = 201220120212226.
The previous prime is 201220120212169. The next prime is 201220120212229. The reversal of 201220120212227 is 722212021022102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201220120212227 - 212 = 201220120208131 is a prime.
Together with 201220120212229, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 201220120212196 and 201220120212205.
It is not a weakly prime, because it can be changed into another prime (201220120212229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100610060106113 + 100610060106114.
It is an arithmetic number, because the mean of its divisors is an integer number (100610060106114).
Almost surely, 2201220120212227 is an apocalyptic number.
201220120212227 is a deficient number, since it is larger than the sum of its proper divisors (1).
201220120212227 is an equidigital number, since it uses as much as digits as its factorization.
201220120212227 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1792, while the sum is 26.
Adding to 201220120212227 its reverse (722212021022102), we get a palindrome (923432141234329).
The spelling of 201220120212227 in words is "two hundred one trillion, two hundred twenty billion, one hundred twenty million, two hundred twelve thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •