Base | Representation |
---|---|
bin | 10010110101100110… |
… | …01011101001000101 |
3 | 222002210221220221222 |
4 | 21122303023221011 |
5 | 131203001113221 |
6 | 4351311050125 |
7 | 505421432513 |
oct | 113263135105 |
9 | 28083856858 |
10 | 10113301061 |
11 | 431a770856 |
12 | 1b62b10945 |
13 | c5230a216 |
14 | 6bd2174b3 |
15 | 3e2cdd9ab |
hex | 25accba45 |
10113301061 has 2 divisors, whose sum is σ = 10113301062. Its totient is φ = 10113301060.
The previous prime is 10113300991. The next prime is 10113301069. The reversal of 10113301061 is 16010331101.
10113301061 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., 9918168100 + 195132961 = 99590^2 + 13969^2 .
It is a cyclic number.
It is not a de Polignac number, because 10113301061 - 218 = 10113038917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10113301069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056650530 + 5056650531.
It is an arithmetic number, because the mean of its divisors is an integer number (5056650531).
Almost surely, 210113301061 is an apocalyptic number.
It is an amenable number.
10113301061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10113301061 is an equidigital number, since it uses as much as digits as its factorization.
10113301061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 10113301061 its reverse (16010331101), we get a palindrome (26123632162).
The spelling of 10113301061 in words is "ten billion, one hundred thirteen million, three hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •