Base | Representation |
---|---|
bin | 1001001100011111001000… |
… | …1110110101000110100001 |
3 | 1022210111222210020112221011 |
4 | 2103013302032311012201 |
5 | 2311121012214140111 |
6 | 33300305334100521 |
7 | 2062301151155032 |
oct | 223076216650641 |
9 | 38714883215834 |
10 | 10110122021281 |
11 | 3248751346567 |
12 | 11734ab4aa741 |
13 | 5844c3a09369 |
14 | 26d4925d6a89 |
15 | 127ec2ae0021 |
hex | 931f23b51a1 |
10110122021281 has 2 divisors, whose sum is σ = 10110122021282. Its totient is φ = 10110122021280.
The previous prime is 10110122021171. The next prime is 10110122021359. The reversal of 10110122021281 is 18212022101101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8301659187600 + 1808462833681 = 2881260^2 + 1344791^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110122021281 - 223 = 10110113632673 is a prime.
It is a super-2 number, since 2×101101220212812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10110122001281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055061010640 + 5055061010641.
It is an arithmetic number, because the mean of its divisors is an integer number (5055061010641).
Almost surely, 210110122021281 is an apocalyptic number.
It is an amenable number.
10110122021281 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110122021281 is an equidigital number, since it uses as much as digits as its factorization.
10110122021281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 22.
Adding to 10110122021281 its reverse (18212022101101), we get a palindrome (28322144122382).
The spelling of 10110122021281 in words is "ten trillion, one hundred ten billion, one hundred twenty-two million, twenty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •