Base | Representation |
---|---|
bin | 110000011111110011… |
… | …1011101111110111001 |
3 | 100221211011001200202211 |
4 | 1200333213131332321 |
5 | 3201243002314022 |
6 | 115502205255121 |
7 | 10344563602663 |
oct | 1407747357671 |
9 | 327734050684 |
10 | 104146526137 |
11 | 40193aa9605 |
12 | 182265644a1 |
13 | 9a898b4ac4 |
14 | 507da37533 |
15 | 2a982a4e77 |
hex | 183f9ddfb9 |
104146526137 has 2 divisors, whose sum is σ = 104146526138. Its totient is φ = 104146526136.
The previous prime is 104146526117. The next prime is 104146526171. The reversal of 104146526137 is 731625641401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 79219168681 + 24927357456 = 281459^2 + 157884^2 .
It is a cyclic number.
It is not a de Polignac number, because 104146526137 - 215 = 104146493369 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104146526137.
It is not a weakly prime, because it can be changed into another prime (104146526117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52073263068 + 52073263069.
It is an arithmetic number, because the mean of its divisors is an integer number (52073263069).
Almost surely, 2104146526137 is an apocalyptic number.
It is an amenable number.
104146526137 is a deficient number, since it is larger than the sum of its proper divisors (1).
104146526137 is an equidigital number, since it uses as much as digits as its factorization.
104146526137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 104146526137 in words is "one hundred four billion, one hundred forty-six million, five hundred twenty-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •