Base | Representation |
---|---|
bin | 111111111101101… |
… | …001001100101001 |
3 | 2202210021100120102 |
4 | 333331221030221 |
5 | 4144204433022 |
6 | 254252435145 |
7 | 35410255541 |
oct | 7775511451 |
9 | 2683240512 |
10 | 1073124137 |
11 | 500829058 |
12 | 25b478ab5 |
13 | 1414309c7 |
14 | a2744321 |
15 | 64327a92 |
hex | 3ff69329 |
1073124137 has 2 divisors, whose sum is σ = 1073124138. Its totient is φ = 1073124136.
The previous prime is 1073124109. The next prime is 1073124263. The reversal of 1073124137 is 7314213701.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 917847616 + 155276521 = 30296^2 + 12461^2 .
It is an emirp because it is prime and its reverse (7314213701) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1073124137 is a prime.
It is not a weakly prime, because it can be changed into another prime (1073124937) 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, 536562068 + 536562069.
It is an arithmetic number, because the mean of its divisors is an integer number (536562069).
Almost surely, 21073124137 is an apocalyptic number.
It is an amenable number.
1073124137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1073124137 is an equidigital number, since it uses as much as digits as its factorization.
1073124137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3528, while the sum is 29.
The square root of 1073124137 is about 32758.5734884778. The cubic root of 1073124137 is about 1023.8036049262.
Adding to 1073124137 its reverse (7314213701), we get a palindrome (8387337838).
The spelling of 1073124137 in words is "one billion, seventy-three million, one hundred twenty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •