Base | Representation |
---|---|
bin | 110000001001111111… |
… | …0010010011000100101 |
3 | 100212221010021021122211 |
4 | 1200103332102120211 |
5 | 3143243030413222 |
6 | 115301411323421 |
7 | 10320463064224 |
oct | 1402376223045 |
9 | 325833237584 |
10 | 103414310437 |
11 | 3a948756069 |
12 | 180612b0571 |
13 | 99a0ca6089 |
14 | 50106b4cbb |
15 | 2a53d6c277 |
hex | 1813f92625 |
103414310437 has 2 divisors, whose sum is σ = 103414310438. Its totient is φ = 103414310436.
The previous prime is 103414310429. The next prime is 103414310453. The reversal of 103414310437 is 734013414301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81842338561 + 21571971876 = 286081^2 + 146874^2 .
It is a cyclic number.
It is not a de Polignac number, because 103414310437 - 23 = 103414310429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103414310399 and 103414310408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103414310737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51707155218 + 51707155219.
It is an arithmetic number, because the mean of its divisors is an integer number (51707155219).
Almost surely, 2103414310437 is an apocalyptic number.
It is an amenable number.
103414310437 is a deficient number, since it is larger than the sum of its proper divisors (1).
103414310437 is an equidigital number, since it uses as much as digits as its factorization.
103414310437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 31.
Adding to 103414310437 its reverse (734013414301), we get a palindrome (837427724738).
The spelling of 103414310437 in words is "one hundred three billion, four hundred fourteen million, three hundred ten thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •