Base | Representation |
---|---|
bin | 11110110000001011111… |
… | …10001111011011011001 |
3 | 10202000102121021020110002 |
4 | 33120011332033123121 |
5 | 114303021003011032 |
6 | 2125231321102345 |
7 | 136225034066045 |
oct | 17300576173331 |
9 | 3660377236402 |
10 | 1056662157017 |
11 | 378145271135 |
12 | 1509560279b5 |
13 | 788483538bc |
14 | 391dd8ad025 |
15 | 1c745e3d862 |
hex | f605f8f6d9 |
1056662157017 has 8 divisors (see below), whose sum is σ = 1059072042600. Its totient is φ = 1054252523520.
The previous prime is 1056662156989. The next prime is 1056662157059. The reversal of 1056662157017 is 7107512666501.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 333726891481 + 722935265536 = 577691^2 + 850256^2 .
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 1056662157017 - 220 = 1056661108441 is a prime.
It is a super-2 number, since 2×10566621570172 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1056662157077) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10240193 + ... + 10342865.
It is an arithmetic number, because the mean of its divisors is an integer number (132384005325).
Almost surely, 21056662157017 is an apocalyptic number.
It is an amenable number.
1056662157017 is a deficient number, since it is larger than the sum of its proper divisors (2409885583).
1056662157017 is a wasteful number, since it uses less digits than its factorization.
1056662157017 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126043.
The product of its (nonzero) digits is 529200, while the sum is 47.
The spelling of 1056662157017 in words is "one trillion, fifty-six billion, six hundred sixty-two million, one hundred fifty-seven thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •