Base | Representation |
---|---|
bin | 1001001100011111001000… |
… | …1000000111001001111101 |
3 | 1022210111222122221002012201 |
4 | 2103013302020013021331 |
5 | 2311121011241311341 |
6 | 33300305232231501 |
7 | 2062301130201532 |
oct | 223076210071175 |
9 | 38714878832181 |
10 | 10110120260221 |
11 | 3248750353443 |
12 | 11734aa99b591 |
13 | 5844c3540907 |
14 | 26d492298d89 |
15 | 127ec2893331 |
hex | 931f220727d |
10110120260221 has 2 divisors, whose sum is σ = 10110120260222. Its totient is φ = 10110120260220.
The previous prime is 10110120260197. The next prime is 10110120260237. The reversal of 10110120260221 is 12206202101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10105246265625 + 4873994596 = 3178875^2 + 69814^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110120260221 - 233 = 10101530325629 is a prime.
It is a super-2 number, since 2×101101202602212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110120260321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055060130110 + 5055060130111.
It is an arithmetic number, because the mean of its divisors is an integer number (5055060130111).
Almost surely, 210110120260221 is an apocalyptic number.
It is an amenable number.
10110120260221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110120260221 is an equidigital number, since it uses as much as digits as its factorization.
10110120260221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 10110120260221 its reverse (12206202101101), we get a palindrome (22316322361322).
The spelling of 10110120260221 in words is "ten trillion, one hundred ten billion, one hundred twenty million, two hundred sixty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •