Base | Representation |
---|---|
bin | 110011101100101001… |
… | …1101110100111111001 |
3 | 101121120011201212000101 |
4 | 1213121103232213321 |
5 | 3304332110304402 |
6 | 123000224035401 |
7 | 11010115341322 |
oct | 1473123564771 |
9 | 347504655011 |
10 | 111020009977 |
11 | 430a09a0768 |
12 | 19624462b61 |
13 | a613921bc6 |
14 | 553285d449 |
15 | 2d4b92cb87 |
hex | 19d94ee9f9 |
111020009977 has 2 divisors, whose sum is σ = 111020009978. Its totient is φ = 111020009976.
The previous prime is 111020009927. The next prime is 111020009983. The reversal of 111020009977 is 779900020111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91254743056 + 19765266921 = 302084^2 + 140589^2 .
It is an emirp because it is prime and its reverse (779900020111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111020009977 - 227 = 110885792249 is a prime.
It is not a weakly prime, because it can be changed into another prime (111020009927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55510004988 + 55510004989.
It is an arithmetic number, because the mean of its divisors is an integer number (55510004989).
Almost surely, 2111020009977 is an apocalyptic number.
It is an amenable number.
111020009977 is a deficient number, since it is larger than the sum of its proper divisors (1).
111020009977 is an equidigital number, since it uses as much as digits as its factorization.
111020009977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7938, while the sum is 37.
The spelling of 111020009977 in words is "one hundred eleven billion, twenty million, nine thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •