Base | Representation |
---|---|
bin | 100000001100011001001… |
… | …010011001111001101101 |
3 | 21211111102002210110022122 |
4 | 200030121022121321231 |
5 | 242221323030042443 |
6 | 4412155220322325 |
7 | 315556415256263 |
oct | 40143112317155 |
9 | 7744362713278 |
10 | 2212330315373 |
11 | 783275873472 |
12 | 2b8920b433a5 |
13 | 13081129b539 |
14 | 791123b4433 |
15 | 3c833bbd968 |
hex | 20319299e6d |
2212330315373 has 2 divisors, whose sum is σ = 2212330315374. Its totient is φ = 2212330315372.
The previous prime is 2212330315367. The next prime is 2212330315381. The reversal of 2212330315373 is 3735130332122.
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., 1834624197289 + 377706118084 = 1354483^2 + 614578^2 .
It is a cyclic number.
It is not a de Polignac number, because 2212330315373 - 26 = 2212330315309 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2212330315343) 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, 1106165157686 + 1106165157687.
It is an arithmetic number, because the mean of its divisors is an integer number (1106165157687).
Almost surely, 22212330315373 is an apocalyptic number.
It is an amenable number.
2212330315373 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212330315373 is an equidigital number, since it uses as much as digits as its factorization.
2212330315373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 35.
Adding to 2212330315373 its reverse (3735130332122), we get a palindrome (5947460647495).
The spelling of 2212330315373 in words is "two trillion, two hundred twelve billion, three hundred thirty million, three hundred fifteen thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •