Base | Representation |
---|---|
bin | 111110111111000… |
… | …010101010101101 |
3 | 2201122101121020221 |
4 | 332333002222231 |
5 | 4131004312024 |
6 | 252505011341 |
7 | 35120626024 |
oct | 7677025255 |
9 | 2648347227 |
10 | 1056713389 |
11 | 4a253a456 |
12 | 255a83b51 |
13 | 13ac061c4 |
14 | a04b18bb |
15 | 62b853e4 |
hex | 3efc2aad |
1056713389 has 2 divisors, whose sum is σ = 1056713390. Its totient is φ = 1056713388.
The previous prime is 1056713363. The next prime is 1056713393. The reversal of 1056713389 is 9833176501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 919120489 + 137592900 = 30317^2 + 11730^2 .
It is an emirp because it is prime and its reverse (9833176501) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1056713389 is a prime.
It is a super-2 number, since 2×10567133892 = 2233286372983730642, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1056513389) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528356694 + 528356695.
It is an arithmetic number, because the mean of its divisors is an integer number (528356695).
Almost surely, 21056713389 is an apocalyptic number.
It is an amenable number.
1056713389 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056713389 is an equidigital number, since it uses as much as digits as its factorization.
1056713389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 136080, while the sum is 43.
The square root of 1056713389 is about 32507.1282798096. The cubic root of 1056713389 is about 1018.5579355942.
The spelling of 1056713389 in words is "one billion, fifty-six million, seven hundred thirteen thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •