Base | Representation |
---|---|
bin | 110000110001001011… |
… | …0011010010010110101 |
3 | 101000022202120111102121 |
4 | 1201202112122102311 |
5 | 3203441142212031 |
6 | 120040103235541 |
7 | 10365200666125 |
oct | 1414226322265 |
9 | 330282514377 |
10 | 104729257141 |
11 | 40462a31a83 |
12 | 18369748bb1 |
13 | 9b50545352 |
14 | 50d71a6c85 |
15 | 2ace511011 |
hex | 186259a4b5 |
104729257141 has 2 divisors, whose sum is σ = 104729257142. Its totient is φ = 104729257140.
The previous prime is 104729257063. The next prime is 104729257151. The reversal of 104729257141 is 141752927401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103214412900 + 1514844241 = 321270^2 + 38921^2 .
It is a cyclic number.
It is not a de Polignac number, because 104729257141 - 229 = 104192386229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104729257151) 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, 52364628570 + 52364628571.
It is an arithmetic number, because the mean of its divisors is an integer number (52364628571).
Almost surely, 2104729257141 is an apocalyptic number.
It is an amenable number.
104729257141 is a deficient number, since it is larger than the sum of its proper divisors (1).
104729257141 is an equidigital number, since it uses as much as digits as its factorization.
104729257141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141120, while the sum is 43.
The spelling of 104729257141 in words is "one hundred four billion, seven hundred twenty-nine million, two hundred fifty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •