Base | Representation |
---|---|
bin | 111110001111000… |
… | …000001001001001 |
3 | 2200202200210120012 |
4 | 332033000021021 |
5 | 4114243321022 |
6 | 251335041305 |
7 | 34605606014 |
oct | 7617001111 |
9 | 2622623505 |
10 | 1044120137 |
11 | 496418a05 |
12 | 251810235 |
13 | 138417188 |
14 | 9c95437b |
15 | 619e8de2 |
hex | 3e3c0249 |
1044120137 has 2 divisors, whose sum is σ = 1044120138. Its totient is φ = 1044120136.
The previous prime is 1044120073. The next prime is 1044120139. The reversal of 1044120137 is 7310214401.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1033236736 + 10883401 = 32144^2 + 3299^2 .
It is a cyclic number.
It is not a de Polignac number, because 1044120137 - 26 = 1044120073 is a prime.
Together with 1044120139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1044120139) 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, 522060068 + 522060069.
It is an arithmetic number, because the mean of its divisors is an integer number (522060069).
Almost surely, 21044120137 is an apocalyptic number.
It is an amenable number.
1044120137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1044120137 is an equidigital number, since it uses as much as digits as its factorization.
1044120137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
The square root of 1044120137 is about 32312.8478627310. The cubic root of 1044120137 is about 1014.4955753503.
Adding to 1044120137 its reverse (7310214401), we get a palindrome (8354334538).
The spelling of 1044120137 in words is "one billion, forty-four million, one hundred twenty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •