Base | Representation |
---|---|
bin | 1001010010010110111110… |
… | …1100001010010011101001 |
3 | 1100011011101220212021210011 |
4 | 2110211233230022103221 |
5 | 2314244122321010441 |
6 | 33414512421251521 |
7 | 2102502242236213 |
oct | 224455754122351 |
9 | 40134356767704 |
10 | 10211011110121 |
11 | 3287513631228 |
12 | 118ab66b63ba1 |
13 | 590b81791c73 |
14 | 2743037735b3 |
15 | 12a929ded581 |
hex | 9496fb0a4e9 |
10211011110121 has 2 divisors, whose sum is σ = 10211011110122. Its totient is φ = 10211011110120.
The previous prime is 10211011110073. The next prime is 10211011110151. The reversal of 10211011110121 is 12101111011201.
10211011110121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6375680550121 + 3835330560000 = 2525011^2 + 1958400^2 .
It is a cyclic number.
It is not a de Polignac number, because 10211011110121 - 29 = 10211011109609 is a prime.
It is not a weakly prime, because it can be changed into another prime (10211011110151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105505555060 + 5105505555061.
It is an arithmetic number, because the mean of its divisors is an integer number (5105505555061).
Almost surely, 210211011110121 is an apocalyptic number.
It is an amenable number.
10211011110121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211011110121 is an equidigital number, since it uses as much as digits as its factorization.
10211011110121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 10211011110121 its reverse (12101111011201), we get a palindrome (22312122121322).
The spelling of 10211011110121 in words is "ten trillion, two hundred eleven billion, eleven million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •