Base | Representation |
---|---|
bin | 1001010010011011100010… |
… | …0010000111100110101001 |
3 | 1100011021120002110121122202 |
4 | 2110212320202013212221 |
5 | 2314304123200330002 |
6 | 33415233555225545 |
7 | 2102544442036325 |
oct | 224467042074651 |
9 | 40137502417582 |
10 | 10212233214377 |
11 | 3287a90465247 |
12 | 118b2482a82b5 |
13 | 591017a2558c |
14 | 2743bbbb8985 |
15 | 12a99c353502 |
hex | 949b88879a9 |
10212233214377 has 2 divisors, whose sum is σ = 10212233214378. Its totient is φ = 10212233214376.
The previous prime is 10212233214307. The next prime is 10212233214409. The reversal of 10212233214377 is 77341233221201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10113443066896 + 98790147481 = 3180164^2 + 314309^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10212233214377 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10212233214377.
It is not a weakly prime, because it can be changed into another prime (10212233214307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106116607188 + 5106116607189.
It is an arithmetic number, because the mean of its divisors is an integer number (5106116607189).
Almost surely, 210212233214377 is an apocalyptic number.
It is an amenable number.
10212233214377 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212233214377 is an equidigital number, since it uses as much as digits as its factorization.
10212233214377 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84672, while the sum is 38.
Adding to 10212233214377 its reverse (77341233221201), we get a palindrome (87553466435578).
The spelling of 10212233214377 in words is "ten trillion, two hundred twelve billion, two hundred thirty-three million, two hundred fourteen thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •