Base | Representation |
---|---|
bin | 110000000001100011000101… |
… | …001100001110111001111111 |
3 | 1000200211201200122110012222001 |
4 | 300001203011030032321333 |
5 | 210141001421214111211 |
6 | 2025113423235003131 |
7 | 62326415423324554 |
oct | 6001430514167177 |
9 | 1020751618405861 |
10 | 211212620066431 |
11 | 613318507a9125 |
12 | 1b8325071394a7 |
13 | 90b1359469c19 |
14 | 3a22a61386a2b |
15 | 19641d1ac1ac1 |
hex | c018c530ee7f |
211212620066431 has 2 divisors, whose sum is σ = 211212620066432. Its totient is φ = 211212620066430.
The previous prime is 211212620066401. The next prime is 211212620066453. The reversal of 211212620066431 is 134660026212112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211212620066431 - 213 = 211212620058239 is a prime.
It is a super-2 number, since 2×2112126200664312 (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 (211212620066401) 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, 105606310033215 + 105606310033216.
It is an arithmetic number, because the mean of its divisors is an integer number (105606310033216).
Almost surely, 2211212620066431 is an apocalyptic number.
211212620066431 is a deficient number, since it is larger than the sum of its proper divisors (1).
211212620066431 is an equidigital number, since it uses as much as digits as its factorization.
211212620066431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 37.
Adding to 211212620066431 its reverse (134660026212112), we get a palindrome (345872646278543).
The spelling of 211212620066431 in words is "two hundred eleven trillion, two hundred twelve billion, six hundred twenty million, sixty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •