Base | Representation |
---|---|
bin | 1011110001010000100… |
… | …0011010000110010001 |
3 | 201022220202020210201011 |
4 | 2330110020122012101 |
5 | 11303102002230111 |
6 | 232520121410521 |
7 | 20415506636416 |
oct | 2742410320621 |
9 | 638822223634 |
10 | 202201211281 |
11 | 78831348883 |
12 | 33230939a41 |
13 | 160b5385c64 |
14 | 9b0259610d |
15 | 53d6830021 |
hex | 2f1421a191 |
202201211281 has 2 divisors, whose sum is σ = 202201211282. Its totient is φ = 202201211280.
The previous prime is 202201211279. The next prime is 202201211287. The reversal of 202201211281 is 182112102202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 194466888256 + 7734323025 = 440984^2 + 87945^2 .
It is a cyclic number.
It is not a de Polignac number, because 202201211281 - 21 = 202201211279 is a prime.
It is a super-2 number, since 2×2022012112812 (a number of 23 digits) contains 22 as substring.
Together with 202201211279, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (202201211287) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101100605640 + 101100605641.
It is an arithmetic number, because the mean of its divisors is an integer number (101100605641).
Almost surely, 2202201211281 is an apocalyptic number.
It is an amenable number.
202201211281 is a deficient number, since it is larger than the sum of its proper divisors (1).
202201211281 is an equidigital number, since it uses as much as digits as its factorization.
202201211281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 202201211281 its reverse (182112102202), we get a palindrome (384313313483).
The spelling of 202201211281 in words is "two hundred two billion, two hundred one million, two hundred eleven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •