Base | Representation |
---|---|
bin | 110000001101000001… |
… | …1100000000011010101 |
3 | 100220012020020221111201 |
4 | 1200122003200003111 |
5 | 3144000140343222 |
6 | 115315454232501 |
7 | 10323142242616 |
oct | 1403203400325 |
9 | 326166227451 |
10 | 103516340437 |
11 | 3a9a0303784 |
12 | 1808b4b5731 |
13 | 99b917a863 |
14 | 5020073c0d |
15 | 2a5ccc3427 |
hex | 181a0e00d5 |
103516340437 has 2 divisors, whose sum is σ = 103516340438. Its totient is φ = 103516340436.
The previous prime is 103516340401. The next prime is 103516340471. The reversal of 103516340437 is 734043615301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81042133041 + 22474207396 = 284679^2 + 149914^2 .
It is a cyclic number.
It is not a de Polignac number, because 103516340437 - 223 = 103507951829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103516340396 and 103516340405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103516340237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51758170218 + 51758170219.
It is an arithmetic number, because the mean of its divisors is an integer number (51758170219).
Almost surely, 2103516340437 is an apocalyptic number.
It is an amenable number.
103516340437 is a deficient number, since it is larger than the sum of its proper divisors (1).
103516340437 is an equidigital number, since it uses as much as digits as its factorization.
103516340437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 37.
Adding to 103516340437 its reverse (734043615301), we get a palindrome (837559955738).
The spelling of 103516340437 in words is "one hundred three billion, five hundred sixteen million, three hundred forty thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •