Base | Representation |
---|---|
bin | 1110000100100… |
… | …10111000001111 |
3 | 22020010011100122 |
4 | 13002102320033 |
5 | 220204322002 |
6 | 15414015155 |
7 | 2632225100 |
oct | 702227017 |
9 | 266104318 |
10 | 118042127 |
11 | 606a4885 |
12 | 336474bb |
13 | 1b5bca18 |
14 | 1196a3a7 |
15 | a56a6a2 |
hex | 7092e0f |
118042127 has 6 divisors (see below), whose sum is σ = 137314368. Its totient is φ = 101178924.
The previous prime is 118042123. The next prime is 118042129. The reversal of 118042127 is 721240811.
It is not a de Polignac number, because 118042127 - 22 = 118042123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 118042096 and 118042105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (118042123) 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 in 5 ways as a sum of consecutive naturals, for example, 1204463 + ... + 1204560.
It is an arithmetic number, because the mean of its divisors is an integer number (22885728).
Almost surely, 2118042127 is an apocalyptic number.
118042127 is a deficient number, since it is larger than the sum of its proper divisors (19272241).
118042127 is an equidigital number, since it uses as much as digits as its factorization.
118042127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2409037 (or 2409030 counting only the distinct ones).
The product of its (nonzero) digits is 896, while the sum is 26.
The square root of 118042127 is about 10864.7193705130. The cubic root of 118042127 is about 490.5451755240.
Adding to 118042127 its reverse (721240811), we get a palindrome (839282938).
It can be divided in two parts, 11804 and 2127, that added together give a palindrome (13931).
The spelling of 118042127 in words is "one hundred eighteen million, forty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •