Base | Representation |
---|---|
bin | 110011101100101111… |
… | …1010000010001001101 |
3 | 101121120101102100120221 |
4 | 1213121133100101031 |
5 | 3304333344000443 |
6 | 123000412511341 |
7 | 11010153124132 |
oct | 1473137202115 |
9 | 347511370527 |
10 | 111023031373 |
11 | 430a2674791 |
12 | 1962547b551 |
13 | a61443c207 |
14 | 5533008589 |
15 | 2d4bd27eed |
hex | 19d97d044d |
111023031373 has 2 divisors, whose sum is σ = 111023031374. Its totient is φ = 111023031372.
The previous prime is 111023031293. The next prime is 111023031377. The reversal of 111023031373 is 373130320111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110395378564 + 627652809 = 332258^2 + 25053^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111023031373 is a prime.
It is a super-2 number, since 2×1110230313732 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111023031377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55511515686 + 55511515687.
It is an arithmetic number, because the mean of its divisors is an integer number (55511515687).
Almost surely, 2111023031373 is an apocalyptic number.
It is an amenable number.
111023031373 is a deficient number, since it is larger than the sum of its proper divisors (1).
111023031373 is an equidigital number, since it uses as much as digits as its factorization.
111023031373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 25.
Adding to 111023031373 its reverse (373130320111), we get a palindrome (484153351484).
The spelling of 111023031373 in words is "one hundred eleven billion, twenty-three million, thirty-one thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •