Base | Representation |
---|---|
bin | 111111000000010… |
… | …100101111100001 |
3 | 2201200000200102001 |
4 | 333000110233201 |
5 | 4131101041234 |
6 | 252520124001 |
7 | 35123526112 |
oct | 7700245741 |
9 | 2650020361 |
10 | 1057049569 |
11 | 4a2749a94 |
12 | 256006601 |
13 | 13acc3224 |
14 | a055c209 |
15 | 62beed14 |
hex | 3f014be1 |
1057049569 has 2 divisors, whose sum is σ = 1057049570. Its totient is φ = 1057049568.
The previous prime is 1057049561. The next prime is 1057049597. The reversal of 1057049569 is 9659407501.
1057049569 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 962240400 + 94809169 = 31020^2 + 9737^2 .
It is an emirp because it is prime and its reverse (9659407501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1057049569 - 23 = 1057049561 is a prime.
It is a super-2 number, since 2×10570495692 = 2234707582646171522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1057049561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528524784 + 528524785.
It is an arithmetic number, because the mean of its divisors is an integer number (528524785).
Almost surely, 21057049569 is an apocalyptic number.
It is an amenable number.
1057049569 is a deficient number, since it is larger than the sum of its proper divisors (1).
1057049569 is an equidigital number, since it uses as much as digits as its factorization.
1057049569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 340200, while the sum is 46.
The square root of 1057049569 is about 32512.2987344789. The cubic root of 1057049569 is about 1018.6659379168.
The spelling of 1057049569 in words is "one billion, fifty-seven million, forty-nine thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •