Base | Representation |
---|---|
bin | 10111101101111110001100… |
… | …101011110011011011100111 |
3 | 111200100100021010002112010012 |
4 | 113231332030223303123213 |
5 | 102133041021114323142 |
6 | 1005505143545520435 |
7 | 30654311613523121 |
oct | 2755761453633347 |
9 | 450310233075105 |
10 | 104314231011047 |
11 | 30268464a372a2 |
12 | b848968aa311b |
13 | 4628a361a3675 |
14 | 1ba8b9b302211 |
15 | c0d6bc49e882 |
hex | 5edf8caf36e7 |
104314231011047 has 2 divisors, whose sum is σ = 104314231011048. Its totient is φ = 104314231011046.
The previous prime is 104314231011013. The next prime is 104314231011059. The reversal of 104314231011047 is 740110132413401.
It is a strong prime.
It is an emirp because it is prime and its reverse (740110132413401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104314231011047 - 222 = 104314226816743 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104314231011077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52157115505523 + 52157115505524.
It is an arithmetic number, because the mean of its divisors is an integer number (52157115505524).
Almost surely, 2104314231011047 is an apocalyptic number.
104314231011047 is a deficient number, since it is larger than the sum of its proper divisors (1).
104314231011047 is an equidigital number, since it uses as much as digits as its factorization.
104314231011047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 32.
Adding to 104314231011047 its reverse (740110132413401), we get a palindrome (844424363424448).
The spelling of 104314231011047 in words is "one hundred four trillion, three hundred fourteen billion, two hundred thirty-one million, eleven thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •