Base | Representation |
---|---|
bin | 110000000101011110… |
… | …1011110111000011001 |
3 | 100212112120202020011022 |
4 | 1200022331132320121 |
5 | 3142440323321122 |
6 | 115234410412225 |
7 | 10313645622545 |
oct | 1401275367031 |
9 | 325476666138 |
10 | 103263104537 |
11 | 3a88036a90a |
12 | 1801a731075 |
13 | 9978874328 |
14 | 4dd8594a25 |
15 | 2a45950642 |
hex | 180af5ee19 |
103263104537 has 2 divisors, whose sum is σ = 103263104538. Its totient is φ = 103263104536.
The previous prime is 103263104513. The next prime is 103263104551. The reversal of 103263104537 is 735401362301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63059245456 + 40203859081 = 251116^2 + 200509^2 .
It is a cyclic number.
It is not a de Polignac number, because 103263104537 - 210 = 103263103513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103263104497 and 103263104506.
It is not a weakly prime, because it can be changed into another prime (103263104137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51631552268 + 51631552269.
It is an arithmetic number, because the mean of its divisors is an integer number (51631552269).
Almost surely, 2103263104537 is an apocalyptic number.
It is an amenable number.
103263104537 is a deficient number, since it is larger than the sum of its proper divisors (1).
103263104537 is an equidigital number, since it uses as much as digits as its factorization.
103263104537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 35.
Adding to 103263104537 its reverse (735401362301), we get a palindrome (838664466838).
The spelling of 103263104537 in words is "one hundred three billion, two hundred sixty-three million, one hundred four thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •