Base | Representation |
---|---|
bin | 110000001101001111… |
… | …1010110100010101001 |
3 | 100220012201222212200221 |
4 | 1200122133112202221 |
5 | 3144004023012023 |
6 | 115320314530041 |
7 | 10323261301555 |
oct | 1403237264251 |
9 | 326181885627 |
10 | 103523641513 |
11 | 3a9a4440126 |
12 | 18091a36921 |
13 | 99ba835b16 |
14 | 5021014865 |
15 | 2a5d76685d |
hex | 181a7d68a9 |
103523641513 has 2 divisors, whose sum is σ = 103523641514. Its totient is φ = 103523641512.
The previous prime is 103523641453. The next prime is 103523641531. The reversal of 103523641513 is 315146325301.
Together with next prime (103523641531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87310203289 + 16213438224 = 295483^2 + 127332^2 .
It is a cyclic number.
It is not a de Polignac number, because 103523641513 - 213 = 103523633321 is a prime.
It is a super-2 number, since 2×1035236415132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103523642513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51761820756 + 51761820757.
It is an arithmetic number, because the mean of its divisors is an integer number (51761820757).
Almost surely, 2103523641513 is an apocalyptic number.
It is an amenable number.
103523641513 is a deficient number, since it is larger than the sum of its proper divisors (1).
103523641513 is an equidigital number, since it uses as much as digits as its factorization.
103523641513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 103523641513 its reverse (315146325301), we get a palindrome (418669966814).
The spelling of 103523641513 in words is "one hundred three billion, five hundred twenty-three million, six hundred forty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •