Base | Representation |
---|---|
bin | 10111101101111101100010… |
… | …101111100011010011001101 |
3 | 111200100021110002000212021121 |
4 | 113231331202233203103031 |
5 | 102133033101000203402 |
6 | 1005504550052000541 |
7 | 30654255310514434 |
oct | 2755754257432315 |
9 | 450307402025247 |
10 | 104313527350477 |
11 | 30268133817735 |
12 | b8487b1300151 |
13 | 4628953482073 |
14 | 1ba8b31a9411b |
15 | c0d67a807837 |
hex | 5edf62be34cd |
104313527350477 has 2 divisors, whose sum is σ = 104313527350478. Its totient is φ = 104313527350476.
The previous prime is 104313527350453. The next prime is 104313527350481. The reversal of 104313527350477 is 774053725313401.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92808060085636 + 11505467264841 = 9633694^2 + 3391971^2 .
It is a cyclic number.
It is not a de Polignac number, because 104313527350477 - 231 = 104311379866829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104313527350427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52156763675238 + 52156763675239.
It is an arithmetic number, because the mean of its divisors is an integer number (52156763675239).
Almost surely, 2104313527350477 is an apocalyptic number.
It is an amenable number.
104313527350477 is a deficient number, since it is larger than the sum of its proper divisors (1).
104313527350477 is an equidigital number, since it uses as much as digits as its factorization.
104313527350477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7408800, while the sum is 52.
The spelling of 104313527350477 in words is "one hundred four trillion, three hundred thirteen billion, five hundred twenty-seven million, three hundred fifty thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •