Base | Representation |
---|---|
bin | 1011110000111010110… |
… | …0011110000011010001 |
3 | 201022200101121212012222 |
4 | 2330032230132003101 |
5 | 11302410130020421 |
6 | 232503102430425 |
7 | 20413321444322 |
oct | 2741654360321 |
9 | 638611555188 |
10 | 202110001361 |
11 | 78794910484 |
12 | 33206292415 |
13 | 1609c4cc3a8 |
14 | 9ad4412449 |
15 | 53cd814cab |
hex | 2f0eb1e0d1 |
202110001361 has 2 divisors, whose sum is σ = 202110001362. Its totient is φ = 202110001360.
The previous prime is 202110001273. The next prime is 202110001391. The reversal of 202110001361 is 163100011202.
202110001361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134909290000 + 67200711361 = 367300^2 + 259231^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202110001361 is a prime.
It is not a weakly prime, because it can be changed into another prime (202110001391) 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, 101055000680 + 101055000681.
It is an arithmetic number, because the mean of its divisors is an integer number (101055000681).
Almost surely, 2202110001361 is an apocalyptic number.
It is an amenable number.
202110001361 is a deficient number, since it is larger than the sum of its proper divisors (1).
202110001361 is an equidigital number, since it uses as much as digits as its factorization.
202110001361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 202110001361 its reverse (163100011202), we get a palindrome (365210012563).
The spelling of 202110001361 in words is "two hundred two billion, one hundred ten million, one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •