Base | Representation |
---|---|
bin | 1011110001010000100… |
… | …0010111110110100011 |
3 | 201022220202020100002111 |
4 | 2330110020113312203 |
5 | 11303102001431313 |
6 | 232520121300151 |
7 | 20415506600536 |
oct | 2742410276643 |
9 | 638822210074 |
10 | 202201202083 |
11 | 78831341981 |
12 | 33230934657 |
13 | 160b5381a0a |
14 | 9b02592a1d |
15 | 53d682c43d |
hex | 2f14217da3 |
202201202083 has 2 divisors, whose sum is σ = 202201202084. Its totient is φ = 202201202082.
The previous prime is 202201202059. The next prime is 202201202129. The reversal of 202201202083 is 380202102202.
It is a happy number.
202201202083 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 202201202083 - 29 = 202201201571 is a prime.
It is a super-2 number, since 2×2022012020832 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (202201202383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101100601041 + 101100601042.
It is an arithmetic number, because the mean of its divisors is an integer number (101100601042).
Almost surely, 2202201202083 is an apocalyptic number.
202201202083 is a deficient number, since it is larger than the sum of its proper divisors (1).
202201202083 is an equidigital number, since it uses as much as digits as its factorization.
202201202083 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 202201202083 its reverse (380202102202), we get a palindrome (582403304285).
The spelling of 202201202083 in words is "two hundred two billion, two hundred one million, two hundred two thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •