Base | Representation |
---|---|
bin | 100000110010010… |
… | …0110000010100101 |
3 | 2211200001111000021 |
4 | 1001210212002211 |
5 | 4223112041122 |
6 | 301055115141 |
7 | 36155540503 |
oct | 10144460245 |
9 | 2750044007 |
10 | 1100112037 |
11 | 514a91502 |
12 | 268512ab1 |
13 | 146bbc98b |
14 | a616b673 |
15 | 668a91c7 |
hex | 419260a5 |
1100112037 has 2 divisors, whose sum is σ = 1100112038. Its totient is φ = 1100112036.
The previous prime is 1100112029. The next prime is 1100112121. The reversal of 1100112037 is 7302110011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 996601761 + 103510276 = 31569^2 + 10174^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100112037 - 23 = 1100112029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1100112037.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100112337) 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, 550056018 + 550056019.
It is an arithmetic number, because the mean of its divisors is an integer number (550056019).
Almost surely, 21100112037 is an apocalyptic number.
It is an amenable number.
1100112037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100112037 is an equidigital number, since it uses as much as digits as its factorization.
1100112037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 16.
The square root of 1100112037 is about 33167.9368818743. The cubic root of 1100112037 is about 1032.3151608021.
Adding to 1100112037 its reverse (7302110011), we get a palindrome (8402222048).
The spelling of 1100112037 in words is "one billion, one hundred million, one hundred twelve thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •