Base | Representation |
---|---|
bin | 100001000001101… |
… | …0011001000001101 |
3 | 2212020012102011101 |
4 | 1002003103020031 |
5 | 4232142123122 |
6 | 301543423101 |
7 | 36314133124 |
oct | 10203231015 |
9 | 2766172141 |
10 | 1108161037 |
11 | 519589875 |
12 | 26b154a91 |
13 | 14877a4b9 |
14 | a7264abb |
15 | 67449027 |
hex | 420d320d |
1108161037 has 2 divisors, whose sum is σ = 1108161038. Its totient is φ = 1108161036.
The previous prime is 1108161007. The next prime is 1108161049. The reversal of 1108161037 is 7301618011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 804913641 + 303247396 = 28371^2 + 17414^2 .
It is a cyclic number.
It is not a de Polignac number, because 1108161037 - 227 = 973943309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1108160996 and 1108161014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1108161007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 554080518 + 554080519.
It is an arithmetic number, because the mean of its divisors is an integer number (554080519).
Almost surely, 21108161037 is an apocalyptic number.
It is an amenable number.
1108161037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1108161037 is an equidigital number, since it uses as much as digits as its factorization.
1108161037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 28.
The square root of 1108161037 is about 33289.0528101957. The cubic root of 1108161037 is about 1034.8266995737.
Adding to 1108161037 its reverse (7301618011), we get a palindrome (8409779048).
The spelling of 1108161037 in words is "one billion, one hundred eight million, one hundred sixty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •