Base | Representation |
---|---|
bin | 1101010001100… |
… | …01101001100101 |
3 | 21202112021210202 |
4 | 12220301221211 |
5 | 212001234141 |
6 | 15014400245 |
7 | 2521323425 |
oct | 650615145 |
9 | 252467722 |
10 | 111352421 |
11 | 579457a4 |
12 | 31360085 |
13 | 1a0b9b0b |
14 | 10b08485 |
15 | 9b9849b |
hex | 6a31a65 |
111352421 has 2 divisors, whose sum is σ = 111352422. Its totient is φ = 111352420.
The previous prime is 111352391. The next prime is 111352471. The reversal of 111352421 is 124253111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64224196 + 47128225 = 8014^2 + 6865^2 .
It is a cyclic number.
It is not a de Polignac number, because 111352421 - 26 = 111352357 is a prime.
It is a super-2 number, since 2×1113524212 = 24798723325122482, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 111352393 and 111352402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111352471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55676210 + 55676211.
It is an arithmetic number, because the mean of its divisors is an integer number (55676211).
Almost surely, 2111352421 is an apocalyptic number.
It is an amenable number.
111352421 is a deficient number, since it is larger than the sum of its proper divisors (1).
111352421 is an equidigital number, since it uses as much as digits as its factorization.
111352421 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 240, while the sum is 20.
The square root of 111352421 is about 10552.3656589411. The cubic root of 111352421 is about 481.0976342077.
The spelling of 111352421 in words is "one hundred eleven million, three hundred fifty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •