Base | Representation |
---|---|
bin | 110011101100000011… |
… | …1011011110011101001 |
3 | 101121111210002202011001 |
4 | 1213120013123303221 |
5 | 3304312000304321 |
6 | 122554231235001 |
7 | 11006453342251 |
oct | 1473007336351 |
9 | 347453082131 |
10 | 111000009961 |
11 | 43090680425 |
12 | 19619818a61 |
13 | a60c73b789 |
14 | 552dd34961 |
15 | 2d49ccbc91 |
hex | 19d81dbce9 |
111000009961 has 2 divisors, whose sum is σ = 111000009962. Its totient is φ = 111000009960.
The previous prime is 111000009941. The next prime is 111000009971. The reversal of 111000009961 is 169900000111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97306563600 + 13693446361 = 311940^2 + 117019^2 .
It is a cyclic number.
It is not a de Polignac number, because 111000009961 - 25 = 111000009929 is a prime.
It is a super-2 number, since 2×1110000099612 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111000009941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55500004980 + 55500004981.
It is an arithmetic number, because the mean of its divisors is an integer number (55500004981).
Almost surely, 2111000009961 is an apocalyptic number.
It is an amenable number.
111000009961 is a deficient number, since it is larger than the sum of its proper divisors (1).
111000009961 is an equidigital number, since it uses as much as digits as its factorization.
111000009961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 28.
The spelling of 111000009961 in words is "one hundred eleven billion, nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •