Base | Representation |
---|---|
bin | 110000100111011101… |
… | …0010101100011000001 |
3 | 100222111000220112212101 |
4 | 1201032322111203001 |
5 | 3202304200134221 |
6 | 115543453230401 |
7 | 10354130652562 |
oct | 1411672254301 |
9 | 328430815771 |
10 | 104403130561 |
11 | 40305933284 |
12 | 18298492401 |
13 | 9acaaca642 |
14 | 50a5b52169 |
15 | 2ab0a90d91 |
hex | 184ee958c1 |
104403130561 has 2 divisors, whose sum is σ = 104403130562. Its totient is φ = 104403130560.
The previous prime is 104403130549. The next prime is 104403130589. The reversal of 104403130561 is 165031304401.
It is an a-pointer prime, because the next prime (104403130589) can be obtained adding 104403130561 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67746198961 + 36656931600 = 260281^2 + 191460^2 .
It is a cyclic number.
It is not a de Polignac number, because 104403130561 - 211 = 104403128513 is a prime.
It is not a weakly prime, because it can be changed into another prime (104403130261) 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, 52201565280 + 52201565281.
It is an arithmetic number, because the mean of its divisors is an integer number (52201565281).
Almost surely, 2104403130561 is an apocalyptic number.
It is an amenable number.
104403130561 is a deficient number, since it is larger than the sum of its proper divisors (1).
104403130561 is an equidigital number, since it uses as much as digits as its factorization.
104403130561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 104403130561 its reverse (165031304401), we get a palindrome (269434434962).
The spelling of 104403130561 in words is "one hundred four billion, four hundred three million, one hundred thirty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •