Base | Representation |
---|---|
bin | 110000001110111001011110… |
… | …100011011101011000010011 |
3 | 1000211002102122220100120000211 |
4 | 300032321132203131120103 |
5 | 210301014240400244443 |
6 | 2031055104131024551 |
7 | 62452613450426524 |
oct | 6016713643353023 |
9 | 1024072586316024 |
10 | 212130021103123 |
11 | 61655922770382 |
12 | 1b960276a3b157 |
13 | 9149a10031836 |
14 | 3a5520d80284b |
15 | 197cec6ae119d |
hex | c0ee5e8dd613 |
212130021103123 has 2 divisors, whose sum is σ = 212130021103124. Its totient is φ = 212130021103122.
The previous prime is 212130021103093. The next prime is 212130021103127. The reversal of 212130021103123 is 321301120031212.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212130021103123 is a prime.
It is a super-2 number, since 2×2121300211031232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212130021103094 and 212130021103103.
It is not a weakly prime, because it can be changed into another prime (212130021103127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106065010551561 + 106065010551562.
It is an arithmetic number, because the mean of its divisors is an integer number (106065010551562).
Almost surely, 2212130021103123 is an apocalyptic number.
212130021103123 is a deficient number, since it is larger than the sum of its proper divisors (1).
212130021103123 is an equidigital number, since it uses as much as digits as its factorization.
212130021103123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 212130021103123 its reverse (321301120031212), we get a palindrome (533431141134335).
The spelling of 212130021103123 in words is "two hundred twelve trillion, one hundred thirty billion, twenty-one million, one hundred three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •