Base | Representation |
---|---|
bin | 1011101101100100101… |
… | …1101011010000110001 |
3 | 201020100211021110010021 |
4 | 2323121023223100301 |
5 | 11244040311243043 |
6 | 232234032003441 |
7 | 20352140404402 |
oct | 2733113532061 |
9 | 636324243107 |
10 | 201212212273 |
11 | 78374059226 |
12 | 32bb5690581 |
13 | 15c884cb147 |
14 | 9a4b0ad9a9 |
15 | 5379ac33ed |
hex | 2ed92eb431 |
201212212273 has 2 divisors, whose sum is σ = 201212212274. Its totient is φ = 201212212272.
The previous prime is 201212212237. The next prime is 201212212309. The reversal of 201212212273 is 372212212102.
Together with previous prime (201212212237) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (201212212237) and next prime (201212212309).
It can be written as a sum of positive squares in only one way, i.e., 200621576464 + 590635809 = 447908^2 + 24303^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201212212273 is a prime.
It is not a weakly prime, because it can be changed into another prime (201212272273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100606106136 + 100606106137.
It is an arithmetic number, because the mean of its divisors is an integer number (100606106137).
Almost surely, 2201212212273 is an apocalyptic number.
It is an amenable number.
201212212273 is a deficient number, since it is larger than the sum of its proper divisors (1).
201212212273 is an equidigital number, since it uses as much as digits as its factorization.
201212212273 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1344, while the sum is 25.
Adding to 201212212273 its reverse (372212212102), we get a palindrome (573424424375).
The spelling of 201212212273 in words is "two hundred one billion, two hundred twelve million, two hundred twelve thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •