Base | Representation |
---|---|
bin | 110000011011100011101110… |
… | …000100001010011100110001 |
3 | 1000221011121021002010000120211 |
4 | 300123203232010022130301 |
5 | 210404243011111241032 |
6 | 2033002504343504121 |
7 | 62602512603020602 |
oct | 6033435604123461 |
9 | 1027147232100524 |
10 | 213000012212017 |
11 | 61960885aa4118 |
12 | 1ba809b5158041 |
13 | 91b0a79631934 |
14 | 3a85381507da9 |
15 | 1995944839747 |
hex | c1b8ee10a731 |
213000012212017 has 2 divisors, whose sum is σ = 213000012212018. Its totient is φ = 213000012212016.
The previous prime is 213000012211967. The next prime is 213000012212021. The reversal of 213000012212017 is 710212210000312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 197340572457616 + 15659439754401 = 14047796^2 + 3957201^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213000012212017 is a prime.
It is a super-2 number, since 2×2130000122120172 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (213000012252017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106500006106008 + 106500006106009.
It is an arithmetic number, because the mean of its divisors is an integer number (106500006106009).
Almost surely, 2213000012212017 is an apocalyptic number.
It is an amenable number.
213000012212017 is a deficient number, since it is larger than the sum of its proper divisors (1).
213000012212017 is an equidigital number, since it uses as much as digits as its factorization.
213000012212017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 213000012212017 its reverse (710212210000312), we get a palindrome (923212222212329).
The spelling of 213000012212017 in words is "two hundred thirteen trillion, twelve million, two hundred twelve thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •