Base | Representation |
---|---|
bin | 100001111100100… |
… | …0100101000011001 |
3 | 2221101021221210111 |
4 | 1003321010220121 |
5 | 4313043102044 |
6 | 305005244321 |
7 | 40140430504 |
oct | 10371045031 |
9 | 2841257714 |
10 | 1139034649 |
11 | 534a56655 |
12 | 2795636a1 |
13 | 151c99ccc |
14 | ab3c013b |
15 | 69ee6b34 |
hex | 43e44a19 |
1139034649 has 2 divisors, whose sum is σ = 1139034650. Its totient is φ = 1139034648.
The previous prime is 1139034593. The next prime is 1139034661. The reversal of 1139034649 is 9464309311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 745290000 + 393744649 = 27300^2 + 19843^2 .
It is an emirp because it is prime and its reverse (9464309311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1139034649 - 27 = 1139034521 is a prime.
It is a super-3 number, since 3×11390346493 (a number of 28 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1139034349) 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, 569517324 + 569517325.
It is an arithmetic number, because the mean of its divisors is an integer number (569517325).
Almost surely, 21139034649 is an apocalyptic number.
It is an amenable number.
1139034649 is a deficient number, since it is larger than the sum of its proper divisors (1).
1139034649 is an equidigital number, since it uses as much as digits as its factorization.
1139034649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 40.
The square root of 1139034649 is about 33749.5873900704. The cubic root of 1139034649 is about 1044.3489756982.
The spelling of 1139034649 in words is "one billion, one hundred thirty-nine million, thirty-four thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •