Base | Representation |
---|---|
bin | 111111000001000… |
… | …100100111011101 |
3 | 2201200101122101201 |
4 | 333001010213131 |
5 | 4131123330121 |
6 | 252524235501 |
7 | 35125303603 |
oct | 7701044735 |
9 | 2650348351 |
10 | 1057245661 |
11 | 4a287334a |
12 | 25609bb91 |
13 | 13b061564 |
14 | a05ad873 |
15 | 62c3ce91 |
hex | 3f0449dd |
1057245661 has 2 divisors, whose sum is σ = 1057245662. Its totient is φ = 1057245660.
The previous prime is 1057245647. The next prime is 1057245667. The reversal of 1057245661 is 1665427501.
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., 634737636 + 422508025 = 25194^2 + 20555^2 .
It is a cyclic number.
It is not a de Polignac number, because 1057245661 - 29 = 1057245149 is a prime.
It is a super-3 number, since 3×10572456613 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1057245661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1057245667) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528622830 + 528622831.
It is an arithmetic number, because the mean of its divisors is an integer number (528622831).
Almost surely, 21057245661 is an apocalyptic number.
It is an amenable number.
1057245661 is a deficient number, since it is larger than the sum of its proper divisors (1).
1057245661 is an equidigital number, since it uses as much as digits as its factorization.
1057245661 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 50400, while the sum is 37.
The square root of 1057245661 is about 32515.3142534406. The cubic root of 1057245661 is about 1018.7289245217.
The spelling of 1057245661 in words is "one billion, fifty-seven million, two hundred forty-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •