Base | Representation |
---|---|
bin | 110000001111010110101111… |
… | …100100000111110000111111 |
3 | 1000211012102202212222000212121 |
4 | 300033112233210013300333 |
5 | 210302023114410033203 |
6 | 2031121342230143411 |
7 | 62455105250240116 |
oct | 6017265744076077 |
9 | 1024172685860777 |
10 | 212161445002303 |
11 | 61668188736995 |
12 | 1b9663867b1b67 |
13 | 914c97a3c2514 |
14 | 3a56950dc0c7d |
15 | 197dc157310bd |
hex | c0f5af907c3f |
212161445002303 has 2 divisors, whose sum is σ = 212161445002304. Its totient is φ = 212161445002302.
The previous prime is 212161445002301. The next prime is 212161445002337. The reversal of 212161445002303 is 303200544161212.
It is an a-pointer prime, because the next prime (212161445002337) can be obtained adding 212161445002303 to its sum of digits (34).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 212161445002303 - 21 = 212161445002301 is a prime.
Together with 212161445002301, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212161445002301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106080722501151 + 106080722501152.
It is an arithmetic number, because the mean of its divisors is an integer number (106080722501152).
Almost surely, 2212161445002303 is an apocalyptic number.
212161445002303 is a deficient number, since it is larger than the sum of its proper divisors (1).
212161445002303 is an equidigital number, since it uses as much as digits as its factorization.
212161445002303 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 212161445002303 its reverse (303200544161212), we get a palindrome (515361989163515).
The spelling of 212161445002303 in words is "two hundred twelve trillion, one hundred sixty-one billion, four hundred forty-five million, two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •