Base | Representation |
---|---|
bin | 110000001101100010… |
… | …0011011010000001001 |
3 | 100220020102021122010222 |
4 | 1200123010123100021 |
5 | 3144014020011022 |
6 | 115321303115425 |
7 | 10323440020004 |
oct | 1403304332011 |
9 | 326212248128 |
10 | 103533360137 |
11 | 3a9a9978949 |
12 | 18095142b75 |
13 | 99bc85959c |
14 | 502242453b |
15 | 2a5e536242 |
hex | 181b11b409 |
103533360137 has 2 divisors, whose sum is σ = 103533360138. Its totient is φ = 103533360136.
The previous prime is 103533360089. The next prime is 103533360157. The reversal of 103533360137 is 731063335301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83465521216 + 20067838921 = 288904^2 + 141661^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103533360137 is a prime.
It is a super-2 number, since 2×1035333601372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103533360097 and 103533360106.
It is not a weakly prime, because it can be changed into another prime (103533360157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51766680068 + 51766680069.
It is an arithmetic number, because the mean of its divisors is an integer number (51766680069).
Almost surely, 2103533360137 is an apocalyptic number.
It is an amenable number.
103533360137 is a deficient number, since it is larger than the sum of its proper divisors (1).
103533360137 is an equidigital number, since it uses as much as digits as its factorization.
103533360137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51030, while the sum is 35.
Adding to 103533360137 its reverse (731063335301), we get a palindrome (834596695438).
The spelling of 103533360137 in words is "one hundred three billion, five hundred thirty-three million, three hundred sixty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •