Base | Representation |
---|---|
bin | 111110111110110… |
… | …101110001111001 |
3 | 2201122021220211211 |
4 | 332332311301321 |
5 | 4131001114401 |
6 | 252503523121 |
7 | 35120316103 |
oct | 7676656171 |
9 | 2648256754 |
10 | 1056660601 |
11 | 4a2503827 |
12 | 255a594a1 |
13 | 13abb8179 |
14 | a049a573 |
15 | 62b74951 |
hex | 3efb5c79 |
1056660601 has 4 divisors (see below), whose sum is σ = 1056790900. Its totient is φ = 1056530304.
The previous prime is 1056660557. The next prime is 1056660643. The reversal of 1056660601 is 1060666501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1060666501 = 12473 ⋅85037.
It can be written as a sum of positive squares in 2 ways, for example, as 387144976 + 669515625 = 19676^2 + 25875^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056660601 - 213 = 1056652409 is a prime.
It is a super-2 number, since 2×10566606012 = 2233063251411362402, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1056660901) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52116 + ... + 69493.
It is an arithmetic number, because the mean of its divisors is an integer number (264197725).
Almost surely, 21056660601 is an apocalyptic number.
It is an amenable number.
1056660601 is a deficient number, since it is larger than the sum of its proper divisors (130299).
1056660601 is an equidigital number, since it uses as much as digits as its factorization.
1056660601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130298.
The product of its (nonzero) digits is 6480, while the sum is 31.
The square root of 1056660601 is about 32506.3163246776. The cubic root of 1056660601 is about 1018.5409746622.
The spelling of 1056660601 in words is "one billion, fifty-six million, six hundred sixty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •