Base | Representation |
---|---|
bin | 100001001101010… |
… | …1001111100111101 |
3 | 2212122201111001202 |
4 | 1002122221330331 |
5 | 4240224040322 |
6 | 302322545245 |
7 | 36420153632 |
oct | 10232517475 |
9 | 2778644052 |
10 | 1114283837 |
11 | 521a90a37 |
12 | 271208225 |
13 | 149b12364 |
14 | a7dba189 |
15 | 67c58292 |
hex | 426a9f3d |
1114283837 has 2 divisors, whose sum is σ = 1114283838. Its totient is φ = 1114283836.
The previous prime is 1114283801. The next prime is 1114283839. The reversal of 1114283837 is 7383824111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 598585156 + 515698681 = 24466^2 + 22709^2 .
It is a cyclic number.
It is not a de Polignac number, because 1114283837 - 218 = 1114021693 is a prime.
Together with 1114283839, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1114283837.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1114283839) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557141918 + 557141919.
It is an arithmetic number, because the mean of its divisors is an integer number (557141919).
Almost surely, 21114283837 is an apocalyptic number.
It is an amenable number.
1114283837 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114283837 is an equidigital number, since it uses as much as digits as its factorization.
1114283837 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32256, while the sum is 38.
The square root of 1114283837 is about 33380.8902966952. The cubic root of 1114283837 is about 1036.7290714987.
The spelling of 1114283837 in words is "one billion, one hundred fourteen million, two hundred eighty-three thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •