Base | Representation |
---|---|
bin | 11001001111100110001111… |
… | …001001010111000101111001 |
3 | 112120002200210112122210221121 |
4 | 121033212033021113011321 |
5 | 104023000111333330243 |
6 | 1032043133420505241 |
7 | 32246101500510115 |
oct | 3117461711270571 |
9 | 476080715583847 |
10 | 111023011230073 |
11 | 3241465a5258a8 |
12 | 105510059ab221 |
13 | 49c456aa5b867 |
14 | 1d5b78455a745 |
15 | cc7e6b2561ed |
hex | 64f98f257179 |
111023011230073 has 2 divisors, whose sum is σ = 111023011230074. Its totient is φ = 111023011230072.
The previous prime is 111023011229971. The next prime is 111023011230077. The reversal of 111023011230073 is 370032110320111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90964821852304 + 20058189377769 = 9537548^2 + 4478637^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111023011230073 is a prime.
It is a super-2 number, since 2×1110230112300732 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111023011230077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55511505615036 + 55511505615037.
It is an arithmetic number, because the mean of its divisors is an integer number (55511505615037).
Almost surely, 2111023011230073 is an apocalyptic number.
It is an amenable number.
111023011230073 is a deficient number, since it is larger than the sum of its proper divisors (1).
111023011230073 is an equidigital number, since it uses as much as digits as its factorization.
111023011230073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756, while the sum is 25.
Adding to 111023011230073 its reverse (370032110320111), we get a palindrome (481055121550184).
The spelling of 111023011230073 in words is "one hundred eleven trillion, twenty-three billion, eleven million, two hundred thirty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •