Base | Representation |
---|---|
bin | 110111010000110110… |
… | …0101101111111011001 |
3 | 102100022210122210120012 |
4 | 1232201230231333121 |
5 | 3421022301041411 |
6 | 130304111211305 |
7 | 11400632420255 |
oct | 1564154557731 |
9 | 370283583505 |
10 | 118676971481 |
11 | 46370069222 |
12 | 1b000816b35 |
13 | b264078663 |
14 | 5a5b74d265 |
15 | 3148c6718b |
hex | 1ba1b2dfd9 |
118676971481 has 2 divisors, whose sum is σ = 118676971482. Its totient is φ = 118676971480.
The previous prime is 118676971477. The next prime is 118676971499. The reversal of 118676971481 is 184179676811.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91167763600 + 27509207881 = 301940^2 + 165859^2 .
It is a cyclic number.
It is not a de Polignac number, because 118676971481 - 22 = 118676971477 is a prime.
It is a super-2 number, since 2×1186769714812 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 118676971481.
It is not a weakly prime, because it can be changed into another prime (118676971421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 59338485740 + 59338485741.
It is an arithmetic number, because the mean of its divisors is an integer number (59338485741).
Almost surely, 2118676971481 is an apocalyptic number.
It is an amenable number.
118676971481 is a deficient number, since it is larger than the sum of its proper divisors (1).
118676971481 is an equidigital number, since it uses as much as digits as its factorization.
118676971481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4064256, while the sum is 59.
The spelling of 118676971481 in words is "one hundred eighteen billion, six hundred seventy-six million, nine hundred seventy-one thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •