Base | Representation |
---|---|
bin | 101111110001100001000111… |
… | …101000110011111100001001 |
3 | 1000112221102012222201012221222 |
4 | 233301201013220303330021 |
5 | 210014424313003014121 |
6 | 2022511354540411425 |
7 | 62154006333266552 |
oct | 5761410750637411 |
9 | 1015842188635858 |
10 | 210111002001161 |
11 | 60a47637057808 |
12 | 1b694b05546b75 |
13 | 90314c83a22a1 |
14 | 39c55d9045329 |
15 | 19457090540ab |
hex | bf1847a33f09 |
210111002001161 has 2 divisors, whose sum is σ = 210111002001162. Its totient is φ = 210111002001160.
The previous prime is 210111002001139. The next prime is 210111002001163. The reversal of 210111002001161 is 161100200111012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 157031850625225 + 53079151375936 = 12531235^2 + 7285544^2 .
It is a cyclic number.
It is not a de Polignac number, because 210111002001161 - 226 = 210110934892297 is a prime.
Together with 210111002001163, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (210111002001163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105055501000580 + 105055501000581.
It is an arithmetic number, because the mean of its divisors is an integer number (105055501000581).
Almost surely, 2210111002001161 is an apocalyptic number.
It is an amenable number.
210111002001161 is a deficient number, since it is larger than the sum of its proper divisors (1).
210111002001161 is an equidigital number, since it uses as much as digits as its factorization.
210111002001161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 210111002001161 its reverse (161100200111012), we get a palindrome (371211202112173).
The spelling of 210111002001161 in words is "two hundred ten trillion, one hundred eleven billion, two million, one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •