Base | Representation |
---|---|
bin | 111111000001010… |
… | …100100101011001 |
3 | 2201200111222010002 |
4 | 333001110211121 |
5 | 4131132423230 |
6 | 252525502345 |
7 | 35125665356 |
oct | 7701244531 |
9 | 2650458102 |
10 | 1057311065 |
11 | 4a29084a8 |
12 | 2561119b5 |
13 | 13b085265 |
14 | a05c962d |
15 | 62c52545 |
hex | 3f054959 |
1057311065 has 8 divisors (see below), whose sum is σ = 1268948160. Its totient is φ = 845732272.
The previous prime is 1057311043. The next prime is 1057311071. The reversal of 1057311065 is 5601137501.
1057311065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1057311065 - 214 = 1057294681 is a prime.
It is a super-3 number, since 3×10573110653 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60332 + ... + 75858.
It is an arithmetic number, because the mean of its divisors is an integer number (158618520).
Almost surely, 21057311065 is an apocalyptic number.
It is an amenable number.
1057311065 is a deficient number, since it is larger than the sum of its proper divisors (211637095).
1057311065 is a wasteful number, since it uses less digits than its factorization.
1057311065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29151.
The product of its (nonzero) digits is 3150, while the sum is 29.
The square root of 1057311065 is about 32516.3199793581. The cubic root of 1057311065 is about 1018.7499311729.
Adding to 1057311065 its reverse (5601137501), we get a palindrome (6658448566).
The spelling of 1057311065 in words is "one billion, fifty-seven million, three hundred eleven thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •