Base | Representation |
---|---|
bin | 11101011001101010011… |
… | …01101101001110011001 |
3 | 10120120112021112020210101 |
4 | 32230311031231032121 |
5 | 113022402241200441 |
6 | 2052030100215401 |
7 | 132661643112535 |
oct | 16546515551631 |
9 | 3516467466711 |
10 | 1010210100121 |
11 | 35a4782a1272 |
12 | 14395139a561 |
13 | 743546685c1 |
14 | 36c7445abc5 |
15 | 1b427cc6231 |
hex | eb3536d399 |
1010210100121 has 2 divisors, whose sum is σ = 1010210100122. Its totient is φ = 1010210100120.
The previous prime is 1010210100101. The next prime is 1010210100127. The reversal of 1010210100121 is 1210010120101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 748259600400 + 261950499721 = 865020^2 + 511811^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010210100121 - 217 = 1010209969049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010210100098 and 1010210100107.
It is not a weakly prime, because it can be changed into another prime (1010210100127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505105050060 + 505105050061.
It is an arithmetic number, because the mean of its divisors is an integer number (505105050061).
Almost surely, 21010210100121 is an apocalyptic number.
It is an amenable number.
1010210100121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010210100121 is an equidigital number, since it uses as much as digits as its factorization.
1010210100121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1010210100121 its reverse (1210010120101), we get a palindrome (2220220220222).
The spelling of 1010210100121 in words is "one trillion, ten billion, two hundred ten million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •