Base | Representation |
---|---|
bin | 110000100010000001100010… |
… | …001101010110110000011011 |
3 | 1000222202002011012202210101002 |
4 | 300202001202031112300123 |
5 | 210434033003124112032 |
6 | 2033542551030015215 |
7 | 62646562532261243 |
oct | 6042014215266033 |
9 | 1028662135683332 |
10 | 213444342410267 |
11 | 620122678985a1 |
12 | 1bb32b3a4a750b |
13 | 921393b185cc7 |
14 | 3a9ca92dc2b23 |
15 | 19a229ce66862 |
hex | c22062356c1b |
213444342410267 has 2 divisors, whose sum is σ = 213444342410268. Its totient is φ = 213444342410266.
The previous prime is 213444342410119. The next prime is 213444342410287. The reversal of 213444342410267 is 762014243444312.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213444342410267 is a prime.
It is a super-2 number, since 2×2134443424102672 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (213444342410287) 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, 106722171205133 + 106722171205134.
It is an arithmetic number, because the mean of its divisors is an integer number (106722171205134).
Almost surely, 2213444342410267 is an apocalyptic number.
213444342410267 is a deficient number, since it is larger than the sum of its proper divisors (1).
213444342410267 is an equidigital number, since it uses as much as digits as its factorization.
213444342410267 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3096576, while the sum is 47.
Adding to 213444342410267 its reverse (762014243444312), we get a palindrome (975458585854579).
The spelling of 213444342410267 in words is "two hundred thirteen trillion, four hundred forty-four billion, three hundred forty-two million, four hundred ten thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •