Base | Representation |
---|---|
bin | 110010010101111110011001… |
… | …111110101110111010001101 |
3 | 1002000221211012210201120001211 |
4 | 302111332121332232322031 |
5 | 213010110140230411323 |
6 | 2102523245530534421 |
7 | 64431343505055001 |
oct | 6225763176567215 |
9 | 1060854183646054 |
10 | 221412442435213 |
11 | 646045425a9387 |
12 | 209bb26ab97411 |
13 | 9671146b8c983 |
14 | 3c965c2b58701 |
15 | 1a8e6a459c70d |
hex | c95f99faee8d |
221412442435213 has 2 divisors, whose sum is σ = 221412442435214. Its totient is φ = 221412442435212.
The previous prime is 221412442435207. The next prime is 221412442435237. The reversal of 221412442435213 is 312534244214122.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114997269847684 + 106415172587529 = 10723678^2 + 10315773^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221412442435213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221412442465213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110706221217606 + 110706221217607.
It is an arithmetic number, because the mean of its divisors is an integer number (110706221217607).
Almost surely, 2221412442435213 is an apocalyptic number.
It is an amenable number.
221412442435213 is a deficient number, since it is larger than the sum of its proper divisors (1).
221412442435213 is an equidigital number, since it uses as much as digits as its factorization.
221412442435213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 368640, while the sum is 40.
Adding to 221412442435213 its reverse (312534244214122), we get a palindrome (533946686649335).
The spelling of 221412442435213 in words is "two hundred twenty-one trillion, four hundred twelve billion, four hundred forty-two million, four hundred thirty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •