Base | Representation |
---|---|
bin | 1110000101001… |
… | …11111111011001 |
3 | 22020021112222101 |
4 | 13002213333121 |
5 | 220220103401 |
6 | 15415523401 |
7 | 2633035153 |
oct | 702477731 |
9 | 266245871 |
10 | 118128601 |
11 | 60753848 |
12 | 33689561 |
13 | 1b6201a6 |
14 | 1198dad3 |
15 | a586101 |
hex | 70a7fd9 |
118128601 has 2 divisors, whose sum is σ = 118128602. Its totient is φ = 118128600.
The previous prime is 118128599. The next prime is 118128649. The reversal of 118128601 is 106821811.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117744201 + 384400 = 10851^2 + 620^2 .
It is an emirp because it is prime and its reverse (106821811) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 118128601 - 21 = 118128599 is a prime.
Together with 118128599, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 118128601.
It is not a weakly prime, because it can be changed into another prime (118128401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 59064300 + 59064301.
It is an arithmetic number, because the mean of its divisors is an integer number (59064301).
Almost surely, 2118128601 is an apocalyptic number.
It is an amenable number.
118128601 is a deficient number, since it is larger than the sum of its proper divisors (1).
118128601 is an equidigital number, since it uses as much as digits as its factorization.
118128601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 28.
The square root of 118128601 is about 10868.6982201182. The cubic root of 118128601 is about 490.6649323442.
The spelling of 118128601 in words is "one hundred eighteen million, one hundred twenty-eight thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •