Base | Representation |
---|---|
bin | 11001001111111010001000… |
… | …100111110010100111010001 |
3 | 112120011201221112101012212022 |
4 | 121033322020213302213101 |
5 | 104023322340402244324 |
6 | 1032101025442541225 |
7 | 32250456112260266 |
oct | 3117721047624721 |
9 | 476151845335768 |
10 | 111044376603089 |
11 | 32422723742876 |
12 | 10555189067815 |
13 | 49c659427cc07 |
14 | 1d5c80dcdd26d |
15 | cc87bbcc705e |
hex | 64fe889f29d1 |
111044376603089 has 2 divisors, whose sum is σ = 111044376603090. Its totient is φ = 111044376603088.
The previous prime is 111044376603031. The next prime is 111044376603119. The reversal of 111044376603089 is 980306673440111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102400394398864 + 8643982204225 = 10119308^2 + 2940065^2 .
It is a cyclic number.
It is not a de Polignac number, because 111044376603089 - 232 = 111040081635793 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 111044376603089.
It is not a weakly prime, because it can be changed into another prime (111044376603029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55522188301544 + 55522188301545.
It is an arithmetic number, because the mean of its divisors is an integer number (55522188301545).
Almost surely, 2111044376603089 is an apocalyptic number.
It is an amenable number.
111044376603089 is a deficient number, since it is larger than the sum of its proper divisors (1).
111044376603089 is an equidigital number, since it uses as much as digits as its factorization.
111044376603089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2612736, while the sum is 53.
The spelling of 111044376603089 in words is "one hundred eleven trillion, forty-four billion, three hundred seventy-six million, six hundred three thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •