Base | Representation |
---|---|
bin | 110000011110110010… |
… | …0100100110010001011 |
3 | 100221201202111102011202 |
4 | 1200331210210302023 |
5 | 3201210211310011 |
6 | 115454542014415 |
7 | 10343666132033 |
oct | 1407544446213 |
9 | 327652442152 |
10 | 104112213131 |
11 | 401766a2753 |
12 | 18216b7740b |
13 | 9a8275c954 |
14 | 50792648c3 |
15 | 2a9527823b |
hex | 183d924c8b |
104112213131 has 2 divisors, whose sum is σ = 104112213132. Its totient is φ = 104112213130.
The previous prime is 104112212993. The next prime is 104112213133. The reversal of 104112213131 is 131312211401.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104112213131 is a prime.
It is a super-2 number, since 2×1041122131312 (a number of 23 digits) contains 22 as substring.
Together with 104112213133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (104112213133) 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, 52056106565 + 52056106566.
It is an arithmetic number, because the mean of its divisors is an integer number (52056106566).
Almost surely, 2104112213131 is an apocalyptic number.
104112213131 is a deficient number, since it is larger than the sum of its proper divisors (1).
104112213131 is an equidigital number, since it uses as much as digits as its factorization.
104112213131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 104112213131 its reverse (131312211401), we get a palindrome (235424424532).
The spelling of 104112213131 in words is "one hundred four billion, one hundred twelve million, two hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •