Base | Representation |
---|---|
bin | 1010000110101011111110… |
… | …1010011110010110001101 |
3 | 1110100002212001221222020011 |
4 | 2201222333222132112031 |
5 | 2424011240224310221 |
6 | 35343510342553221 |
7 | 2224446116301502 |
oct | 241527752362615 |
9 | 43302761858204 |
10 | 11110001010061 |
11 | 35a37a7a29988 |
12 | 12b5238a38811 |
13 | 62788cbb5915 |
14 | 2a5a2693d4a9 |
15 | 143ee39011e1 |
hex | a1abfa9e58d |
11110001010061 has 2 divisors, whose sum is σ = 11110001010062. Its totient is φ = 11110001010060.
The previous prime is 11110001010023. The next prime is 11110001010079. The reversal of 11110001010061 is 16001010001111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8682044933961 + 2427956076100 = 2946531^2 + 1558190^2 .
It is a cyclic number.
It is not a de Polignac number, because 11110001010061 - 235 = 11075641271693 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11110001610061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555000505030 + 5555000505031.
It is an arithmetic number, because the mean of its divisors is an integer number (5555000505031).
Almost surely, 211110001010061 is an apocalyptic number.
It is an amenable number.
11110001010061 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110001010061 is an equidigital number, since it uses as much as digits as its factorization.
11110001010061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 11110001010061 its reverse (16001010001111), we get a palindrome (27111011011172).
The spelling of 11110001010061 in words is "eleven trillion, one hundred ten billion, one million, ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •