Base | Representation |
---|---|
bin | 10010110101010011… |
… | …00001111101010111 |
3 | 222002122012101102011 |
4 | 21122221201331113 |
5 | 131201324133111 |
6 | 4351140525051 |
7 | 505361064364 |
oct | 113251417527 |
9 | 28078171364 |
10 | 10110771031 |
11 | 43192a2a19 |
12 | 1b620b0787 |
13 | c5193276a |
14 | 6bcb5946b |
15 | 3e298e021 |
hex | 25aa61f57 |
10110771031 has 2 divisors, whose sum is σ = 10110771032. Its totient is φ = 10110771030.
The previous prime is 10110771001. The next prime is 10110771037. The reversal of 10110771031 is 13017701101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10110771031 - 227 = 9976553303 is a prime.
It is a super-2 number, since 2×101107710312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10110770993 and 10110771011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110771037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055385515 + 5055385516.
It is an arithmetic number, because the mean of its divisors is an integer number (5055385516).
Almost surely, 210110771031 is an apocalyptic number.
10110771031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110771031 is an equidigital number, since it uses as much as digits as its factorization.
10110771031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 147, while the sum is 22.
The spelling of 10110771031 in words is "ten billion, one hundred ten million, seven hundred seventy-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •