Base | Representation |
---|---|
bin | 110000000001100010100110… |
… | …010000111101011111000111 |
3 | 1000200211200100111010200122002 |
4 | 300001202212100331133013 |
5 | 210140444340402241403 |
6 | 2025113255542055515 |
7 | 62326366523202665 |
oct | 6001424620753707 |
9 | 1020750314120562 |
10 | 211212101212103 |
11 | 613316049341a2 |
12 | 1b8323a141a59b |
13 | 90b12a5b13024 |
14 | 3a22a124c3c35 |
15 | 19641a1282188 |
hex | c018a643d7c7 |
211212101212103 has 2 divisors, whose sum is σ = 211212101212104. Its totient is φ = 211212101212102.
The previous prime is 211212101212093. The next prime is 211212101212127. The reversal of 211212101212103 is 301212101212112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211212101212103 - 28 = 211212101211847 is a prime.
It is a super-2 number, since 2×2112121012121032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211212101292103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105606050606051 + 105606050606052.
It is an arithmetic number, because the mean of its divisors is an integer number (105606050606052).
Almost surely, 2211212101212103 is an apocalyptic number.
211212101212103 is a deficient number, since it is larger than the sum of its proper divisors (1).
211212101212103 is an equidigital number, since it uses as much as digits as its factorization.
211212101212103 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 211212101212103 its reverse (301212101212112), we get a palindrome (512424202424215).
Subtracting 211212101212103 from its reverse (301212101212112), we obtain a palindrome (90000000000009).
The spelling of 211212101212103 in words is "two hundred eleven trillion, two hundred twelve billion, one hundred one million, two hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •