Base | Representation |
---|---|
bin | 110111010110110000… |
… | …1010110001101100001 |
3 | 102100211121212210120211 |
4 | 1232231201112031201 |
5 | 3421424040121324 |
6 | 130335514334121 |
7 | 11405561344324 |
oct | 1565541261541 |
9 | 370747783524 |
10 | 118875317089 |
11 | 46462021211 |
12 | 1b05712a341 |
13 | b2961a3919 |
14 | 5a79c207bb |
15 | 315b396294 |
hex | 1bad856361 |
118875317089 has 9 divisors (see below), whose sum is σ = 119281821267. Its totient is φ = 118470197064.
The previous prime is 118875317063. The next prime is 118875317123. The reversal of 118875317089 is 980713578811.
The square root of 118875317089 is 344783.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 10431558225 + 108443758864 = 102135^2 + 329308^2 .
It is not a de Polignac number, because 118875317089 - 219 = 118874792801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (118875317789) 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 in 8 ways as a sum of consecutive naturals, for example, 192043822 + ... + 192044440.
Almost surely, 2118875317089 is an apocalyptic number.
118875317089 is the 344783-rd square number.
118875317089 is the 172392-nd centered octagonal number.
It is an amenable number.
118875317089 is a deficient number, since it is larger than the sum of its proper divisors (406504178).
118875317089 is an frugal number, since it uses more digits than its factorization.
118875317089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2352 (or 1176 counting only the distinct ones).
The product of its (nonzero) digits is 3386880, while the sum is 58.
The spelling of 118875317089 in words is "one hundred eighteen billion, eight hundred seventy-five million, three hundred seventeen thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •