Base | Representation |
---|---|
bin | 1101010010000… |
… | …11001110110001 |
3 | 21202122221120212 |
4 | 12221003032301 |
5 | 212011040213 |
6 | 15020113505 |
7 | 2522043401 |
oct | 651031661 |
9 | 252587525 |
10 | 111424433 |
11 | 5799490a |
12 | 31395895 |
13 | 1a113823 |
14 | 10b26801 |
15 | 9bae9a8 |
hex | 6a433b1 |
111424433 has 2 divisors, whose sum is σ = 111424434. Its totient is φ = 111424432.
The previous prime is 111424393. The next prime is 111424459. The reversal of 111424433 is 334424111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81306289 + 30118144 = 9017^2 + 5488^2 .
It is a cyclic number.
It is not a de Polignac number, because 111424433 - 210 = 111423409 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111424399 and 111424408.
It is not a weakly prime, because it can be changed into another prime (111424463) 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, 55712216 + 55712217.
It is an arithmetic number, because the mean of its divisors is an integer number (55712217).
Almost surely, 2111424433 is an apocalyptic number.
It is an amenable number.
111424433 is a deficient number, since it is larger than the sum of its proper divisors (1).
111424433 is an equidigital number, since it uses as much as digits as its factorization.
111424433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 23.
The square root of 111424433 is about 10555.7772333448. Note that the first 3 decimals coincide. The cubic root of 111424433 is about 481.2013210334.
Adding to 111424433 its reverse (334424111), we get a palindrome (445848544).
The spelling of 111424433 in words is "one hundred eleven million, four hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •