Base | Representation |
---|---|
bin | 110000000001010001… |
… | …1000111010100001001 |
3 | 100212011202012002012021 |
4 | 1200002203013110021 |
5 | 3142143211141122 |
6 | 115212405444441 |
7 | 10310313215041 |
oct | 1400243072411 |
9 | 325152162167 |
10 | 103121974537 |
11 | 3a80873684a |
12 | 17b9b410721 |
13 | 995555c85a |
14 | 4dc3938721 |
15 | 2a383741c7 |
hex | 18028c7509 |
103121974537 has 2 divisors, whose sum is σ = 103121974538. Its totient is φ = 103121974536.
The previous prime is 103121974531. The next prime is 103121974573. The reversal of 103121974537 is 735479121301.
Together with next prime (103121974573) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94030542736 + 9091431801 = 306644^2 + 95349^2 .
It is a cyclic number.
It is not a de Polignac number, because 103121974537 - 211 = 103121972489 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103121974493 and 103121974502.
It is not a weakly prime, because it can be changed into another prime (103121974531) 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, 51560987268 + 51560987269.
It is an arithmetic number, because the mean of its divisors is an integer number (51560987269).
Almost surely, 2103121974537 is an apocalyptic number.
It is an amenable number.
103121974537 is a deficient number, since it is larger than the sum of its proper divisors (1).
103121974537 is an equidigital number, since it uses as much as digits as its factorization.
103121974537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 158760, while the sum is 43.
The spelling of 103121974537 in words is "one hundred three billion, one hundred twenty-one million, nine hundred seventy-four thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •