Base | Representation |
---|---|
bin | 100001011001000… |
… | …0010010101101101 |
3 | 2220002020212202011 |
4 | 1002302002111231 |
5 | 4243311204122 |
6 | 303102201221 |
7 | 36523232212 |
oct | 10262022555 |
9 | 2802225664 |
10 | 1120413037 |
11 | 525497997 |
12 | 273283211 |
13 | 14b17a0c3 |
14 | a8b33b09 |
15 | 68569377 |
hex | 42c8256d |
1120413037 has 2 divisors, whose sum is σ = 1120413038. Its totient is φ = 1120413036.
The previous prime is 1120413013. The next prime is 1120413083. The reversal of 1120413037 is 7303140211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1046263716 + 74149321 = 32346^2 + 8611^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1120413037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120412999 and 1120413017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120413137) 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, 560206518 + 560206519.
It is an arithmetic number, because the mean of its divisors is an integer number (560206519).
Almost surely, 21120413037 is an apocalyptic number.
It is an amenable number.
1120413037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120413037 is an equidigital number, since it uses as much as digits as its factorization.
1120413037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 1120413037 is about 33472.5714130241. The cubic root of 1120413037 is about 1038.6264649296.
Adding to 1120413037 its reverse (7303140211), we get a palindrome (8423553248).
The spelling of 1120413037 in words is "one billion, one hundred twenty million, four hundred thirteen thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •