Base | Representation |
---|---|
bin | 1110000111001… |
… | …10111011111111 |
3 | 22020202122122122 |
4 | 13003212323333 |
5 | 220301331211 |
6 | 15425233155 |
7 | 2635160642 |
oct | 703467377 |
9 | 266678578 |
10 | 118386431 |
11 | 6090a529 |
12 | 337927bb |
13 | 1b6b0657 |
14 | 11a19a59 |
15 | a5d76db |
hex | 70e6eff |
118386431 has 2 divisors, whose sum is σ = 118386432. Its totient is φ = 118386430.
The previous prime is 118386413. The next prime is 118386461. The reversal of 118386431 is 134683811.
Together with previous prime (118386413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-118386431 is a prime.
It is a super-2 number, since 2×1183864312 = 28030694089835522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 118386391 and 118386400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (118386461) 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, 59193215 + 59193216.
It is an arithmetic number, because the mean of its divisors is an integer number (59193216).
Almost surely, 2118386431 is an apocalyptic number.
118386431 is a deficient number, since it is larger than the sum of its proper divisors (1).
118386431 is an equidigital number, since it uses as much as digits as its factorization.
118386431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13824, while the sum is 35.
The square root of 118386431 is about 10880.5528811729. The cubic root of 118386431 is about 491.0216515189.
The spelling of 118386431 in words is "one hundred eighteen million, three hundred eighty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •