Base | Representation |
---|---|
bin | 1100010110111001000… |
… | …0001000011110011111 |
3 | 202021222202202221201011 |
4 | 3011232100020132133 |
5 | 11434244044322122 |
6 | 241310344400051 |
7 | 21224032514236 |
oct | 3055620103637 |
9 | 667882687634 |
10 | 212303120287 |
11 | 82045638605 |
12 | 3518ba76027 |
13 | 17035204acb |
14 | a3c0085b1d |
15 | 57c861d377 |
hex | 316e40879f |
212303120287 has 2 divisors, whose sum is σ = 212303120288. Its totient is φ = 212303120286.
The previous prime is 212303120273. The next prime is 212303120299. The reversal of 212303120287 is 782021303212.
212303120287 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212303120287 - 211 = 212303118239 is a prime.
It is a super-2 number, since 2×2123031202872 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212303120257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106151560143 + 106151560144.
It is an arithmetic number, because the mean of its divisors is an integer number (106151560144).
Almost surely, 2212303120287 is an apocalyptic number.
212303120287 is a deficient number, since it is larger than the sum of its proper divisors (1).
212303120287 is an equidigital number, since it uses as much as digits as its factorization.
212303120287 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 31.
Adding to 212303120287 its reverse (782021303212), we get a palindrome (994324423499).
The spelling of 212303120287 in words is "two hundred twelve billion, three hundred three million, one hundred twenty thousand, two hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •