Base | Representation |
---|---|
bin | 100001001101010… |
… | …0000001111011001 |
3 | 2212122122110111102 |
4 | 1002122200033121 |
5 | 4240221302212 |
6 | 302322041145 |
7 | 36416626643 |
oct | 10232401731 |
9 | 2778573442 |
10 | 1114244057 |
11 | 521a64063 |
12 | 2711a91b5 |
13 | 149aca214 |
14 | a7da9893 |
15 | 67c4b5c2 |
hex | 426a03d9 |
1114244057 has 2 divisors, whose sum is σ = 1114244058. Its totient is φ = 1114244056.
The previous prime is 1114244023. The next prime is 1114244059. The reversal of 1114244057 is 7504424111.
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., 979126681 + 135117376 = 31291^2 + 11624^2 .
It is a cyclic number.
It is not a de Polignac number, because 1114244057 - 210 = 1114243033 is a prime.
Together with 1114244059, 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 (1114244059) 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, 557122028 + 557122029.
It is an arithmetic number, because the mean of its divisors is an integer number (557122029).
Almost surely, 21114244057 is an apocalyptic number.
It is an amenable number.
1114244057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114244057 is an equidigital number, since it uses as much as digits as its factorization.
1114244057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4480, while the sum is 29.
The square root of 1114244057 is about 33380.2944414815. The cubic root of 1114244057 is about 1036.7167342552.
Adding to 1114244057 its reverse (7504424111), we get a palindrome (8618668168).
The spelling of 1114244057 in words is "one billion, one hundred fourteen million, two hundred forty-four thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •