Base | Representation |
---|---|
bin | 10010101111011000… |
… | …00100101110001101 |
3 | 221222011202010212211 |
4 | 21113230010232031 |
5 | 131101120343221 |
6 | 4342204230421 |
7 | 504215663506 |
oct | 112754045615 |
9 | 27864663784 |
10 | 10061106061 |
11 | 42a3260996 |
12 | 1b4953b411 |
13 | c445639c6 |
14 | 6b630bbad |
15 | 3dd42d6e1 |
hex | 257b04b8d |
10061106061 has 2 divisors, whose sum is σ = 10061106062. Its totient is φ = 10061106060.
The previous prime is 10061106059. The next prime is 10061106113. The reversal of 10061106061 is 16060116001.
10061106061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5758533225 + 4302572836 = 75885^2 + 65594^2 .
It is an emirp because it is prime and its reverse (16060116001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10061106061 - 21 = 10061106059 is a prime.
Together with 10061106059, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10061106661) 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, 5030553030 + 5030553031.
It is an arithmetic number, because the mean of its divisors is an integer number (5030553031).
Almost surely, 210061106061 is an apocalyptic number.
It is an amenable number.
10061106061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10061106061 is an equidigital number, since it uses as much as digits as its factorization.
10061106061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
The spelling of 10061106061 in words is "ten billion, sixty-one million, one hundred six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •