Base | Representation |
---|---|
bin | 110011111001001110… |
… | …1100111101001001111 |
3 | 101122122120211212002021 |
4 | 1213302131213221033 |
5 | 3311213130030411 |
6 | 123110141311011 |
7 | 11023431436654 |
oct | 1476235475117 |
9 | 348576755067 |
10 | 111442033231 |
11 | 43298139011 |
12 | 19721865467 |
13 | a6801a47c9 |
14 | 5572917c2b |
15 | 2d739e1a71 |
hex | 19f2767a4f |
111442033231 has 2 divisors, whose sum is σ = 111442033232. Its totient is φ = 111442033230.
The previous prime is 111442033229. The next prime is 111442033259. The reversal of 111442033231 is 132330244111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 111442033231 - 21 = 111442033229 is a prime.
It is a super-2 number, since 2×1114420332312 (a number of 23 digits) contains 22 as substring.
Together with 111442033229, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 111442033196 and 111442033205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111442033201) 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, 55721016615 + 55721016616.
It is an arithmetic number, because the mean of its divisors is an integer number (55721016616).
Almost surely, 2111442033231 is an apocalyptic number.
111442033231 is a deficient number, since it is larger than the sum of its proper divisors (1).
111442033231 is an equidigital number, since it uses as much as digits as its factorization.
111442033231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 111442033231 its reverse (132330244111), we get a palindrome (243772277342).
The spelling of 111442033231 in words is "one hundred eleven billion, four hundred forty-two million, thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •