Base | Representation |
---|---|
bin | 1001010010011010101101… |
… | …0011001111010111101101 |
3 | 1100011020222121201122012121 |
4 | 2110212223103033113231 |
5 | 2314303144332211341 |
6 | 33415155545032541 |
7 | 2102536105035022 |
oct | 224465323172755 |
9 | 40136877648177 |
10 | 10212011210221 |
11 | 3287987113237 |
12 | 118b1a5a85751 |
13 | 590cb0a35882 |
14 | 27439a509549 |
15 | 12a987aee4d1 |
hex | 949ab4cf5ed |
10212011210221 has 2 divisors, whose sum is σ = 10212011210222. Its totient is φ = 10212011210220.
The previous prime is 10212011210129. The next prime is 10212011210257. The reversal of 10212011210221 is 12201211021201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10029413955625 + 182597254596 = 3166925^2 + 427314^2 .
It is a cyclic number.
It is not a de Polignac number, because 10212011210221 - 29 = 10212011209709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10212011210195 and 10212011210204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10212017210221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106005605110 + 5106005605111.
It is an arithmetic number, because the mean of its divisors is an integer number (5106005605111).
Almost surely, 210212011210221 is an apocalyptic number.
It is an amenable number.
10212011210221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212011210221 is an equidigital number, since it uses as much as digits as its factorization.
10212011210221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10212011210221 its reverse (12201211021201), we get a palindrome (22413222231422).
The spelling of 10212011210221 in words is "ten trillion, two hundred twelve billion, eleven million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •