Base | Representation |
---|---|
bin | 11110100100110011011… |
… | …100110110110010011001 |
3 | 21102212022102111021100211 |
4 | 132210303130312302121 |
5 | 233411024131211301 |
6 | 4245122200131121 |
7 | 304541162053261 |
oct | 36446334666231 |
9 | 7385272437324 |
10 | 2101102210201 |
11 | 740088470805 |
12 | 29b25aa66aa1 |
13 | 1231965197a7 |
14 | 739a00667a1 |
15 | 399c3d88051 |
hex | 1e933736c99 |
2101102210201 has 2 divisors, whose sum is σ = 2101102210202. Its totient is φ = 2101102210200.
The previous prime is 2101102210199. The next prime is 2101102210231. The reversal of 2101102210201 is 1020122011012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1351534128025 + 749568082176 = 1162555^2 + 865776^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101102210201 - 21 = 2101102210199 is a prime.
Together with 2101102210199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2101102210231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050551105100 + 1050551105101.
It is an arithmetic number, because the mean of its divisors is an integer number (1050551105101).
Almost surely, 22101102210201 is an apocalyptic number.
It is an amenable number.
2101102210201 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101102210201 is an equidigital number, since it uses as much as digits as its factorization.
2101102210201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2101102210201 its reverse (1020122011012), we get a palindrome (3121224221213).
The spelling of 2101102210201 in words is "two trillion, one hundred one billion, one hundred two million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •