Base | Representation |
---|---|
bin | 110000010001010110… |
… | …1010111000110010001 |
3 | 100220120100110102020212 |
4 | 1200202231113012101 |
5 | 3144244323002122 |
6 | 115342122213505 |
7 | 10326554323364 |
oct | 1404255270621 |
9 | 326510412225 |
10 | 103661531537 |
11 | 3aa65260a23 |
12 | 18110054295 |
13 | 9a10284955 |
14 | 503546a0db |
15 | 2a6a902ce2 |
hex | 1822b57191 |
103661531537 has 2 divisors, whose sum is σ = 103661531538. Its totient is φ = 103661531536.
The previous prime is 103661531503. The next prime is 103661531569. The reversal of 103661531537 is 735135166301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96196744336 + 7464787201 = 310156^2 + 86399^2 .
It is a cyclic number.
It is not a de Polignac number, because 103661531537 - 26 = 103661531473 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103661531494 and 103661531503.
It is not a weakly prime, because it can be changed into another prime (103661530537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51830765768 + 51830765769.
It is an arithmetic number, because the mean of its divisors is an integer number (51830765769).
Almost surely, 2103661531537 is an apocalyptic number.
It is an amenable number.
103661531537 is a deficient number, since it is larger than the sum of its proper divisors (1).
103661531537 is an equidigital number, since it uses as much as digits as its factorization.
103661531537 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 170100, while the sum is 41.
Adding to 103661531537 its reverse (735135166301), we get a palindrome (838796697838).
The spelling of 103661531537 in words is "one hundred three billion, six hundred sixty-one million, five hundred thirty-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •