Base | Representation |
---|---|
bin | 10111110100010110000001… |
… | …001101111000001101111011 |
3 | 111201220012112201102021020012 |
4 | 113310112001031320031323 |
5 | 102212224323032444042 |
6 | 1010442243443452135 |
7 | 31031043213434531 |
oct | 2764260115701573 |
9 | 451805481367205 |
10 | 104752125281147 |
11 | 30417143925693 |
12 | b8b97b698704b |
13 | 465b11054b326 |
14 | 1bc205c134151 |
15 | c19c9aa84e82 |
hex | 5f458137837b |
104752125281147 has 2 divisors, whose sum is σ = 104752125281148. Its totient is φ = 104752125281146.
The previous prime is 104752125281101. The next prime is 104752125281149. The reversal of 104752125281147 is 741182521257401.
It is a strong prime.
It is an emirp because it is prime and its reverse (741182521257401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104752125281147 - 210 = 104752125280123 is a prime.
Together with 104752125281149, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 104752125281095 and 104752125281104.
It is not a weakly prime, because it can be changed into another prime (104752125281149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52376062640573 + 52376062640574.
It is an arithmetic number, because the mean of its divisors is an integer number (52376062640574).
Almost surely, 2104752125281147 is an apocalyptic number.
104752125281147 is a deficient number, since it is larger than the sum of its proper divisors (1).
104752125281147 is an equidigital number, since it uses as much as digits as its factorization.
104752125281147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1254400, while the sum is 50.
The spelling of 104752125281147 in words is "one hundred four trillion, seven hundred fifty-two billion, one hundred twenty-five million, two hundred eighty-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •