Base | Representation |
---|---|
bin | 1011110000100101010… |
… | …1001001010101000101 |
3 | 201022110010021101001201 |
4 | 2330021111021111011 |
5 | 11302214110013333 |
6 | 232450125422501 |
7 | 20411146451011 |
oct | 2741125112505 |
9 | 638403241051 |
10 | 202020001093 |
11 | 78749029999 |
12 | 331a010aa31 |
13 | 1608697a2b1 |
14 | 9ac64a5541 |
15 | 53c598817d |
hex | 2f09549545 |
202020001093 has 2 divisors, whose sum is σ = 202020001094. Its totient is φ = 202020001092.
The previous prime is 202020001013. The next prime is 202020001133. The reversal of 202020001093 is 390100020202.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 189888520644 + 12131480449 = 435762^2 + 110143^2 .
It is a cyclic number.
It is not a de Polignac number, because 202020001093 - 217 = 202019870021 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202020001093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202020001003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101010000546 + 101010000547.
It is an arithmetic number, because the mean of its divisors is an integer number (101010000547).
Almost surely, 2202020001093 is an apocalyptic number.
It is an amenable number.
202020001093 is a deficient number, since it is larger than the sum of its proper divisors (1).
202020001093 is an equidigital number, since it uses as much as digits as its factorization.
202020001093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 202020001093 its reverse (390100020202), we get a palindrome (592120021295).
The spelling of 202020001093 in words is "two hundred two billion, twenty million, one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •