Base | Representation |
---|---|
bin | 10111101100111001000100… |
… | …010111001101101100100001 |
3 | 111200002020200001101112112021 |
4 | 113230321010113031230201 |
5 | 102130332011310210032 |
6 | 1005411110230301441 |
7 | 30646043311603003 |
oct | 2754710427155441 |
9 | 450066601345467 |
10 | 104240003210017 |
11 | 30239a3430a794 |
12 | b8364b21b7881 |
13 | 4621a36b981cc |
14 | 1ba5358dd8373 |
15 | c0b7c5b1c097 |
hex | 5ece445cdb21 |
104240003210017 has 2 divisors, whose sum is σ = 104240003210018. Its totient is φ = 104240003210016.
The previous prime is 104240003209919. The next prime is 104240003210033. The reversal of 104240003210017 is 710012300042401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94319525406976 + 9920477803041 = 9711824^2 + 3149679^2 .
It is a cyclic number.
It is not a de Polignac number, because 104240003210017 - 211 = 104240003207969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104240003209973 and 104240003210000.
It is not a weakly prime, because it can be changed into another prime (104240003210617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52120001605008 + 52120001605009.
It is an arithmetic number, because the mean of its divisors is an integer number (52120001605009).
Almost surely, 2104240003210017 is an apocalyptic number.
It is an amenable number.
104240003210017 is a deficient number, since it is larger than the sum of its proper divisors (1).
104240003210017 is an equidigital number, since it uses as much as digits as its factorization.
104240003210017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1344, while the sum is 25.
Adding to 104240003210017 its reverse (710012300042401), we get a palindrome (814252303252418).
The spelling of 104240003210017 in words is "one hundred four trillion, two hundred forty billion, three million, two hundred ten thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •