Base | Representation |
---|---|
bin | 111110111110101… |
… | …000011100110001 |
3 | 2201122012010221121 |
4 | 332332220130301 |
5 | 4130442343001 |
6 | 252502422241 |
7 | 35120000653 |
oct | 7676503461 |
9 | 2648163847 |
10 | 1056606001 |
11 | 4a2476800 |
12 | 255a31981 |
13 | 13ab99369 |
14 | a04846d3 |
15 | 62b636a1 |
hex | 3efa8731 |
1056606001 has 12 divisors (see below), whose sum is σ = 1163612212. Its totient is φ = 958716000.
The previous prime is 1056605999. The next prime is 1056606011. The reversal of 1056606001 is 1006066501.
It can be written as a sum of positive squares in 2 ways, for example, as 425390625 + 631215376 = 20625^2 + 25124^2 .
It is not a de Polignac number, because 1056606001 - 21 = 1056605999 is a prime.
It is a super-2 number, since 2×10566060012 = 2232832482698424002, which contains 22 as substring.
It is a hoax number, since the sum of its digits (25) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1056606011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 57391 + ... + 73531.
Almost surely, 21056606001 is an apocalyptic number.
1056606001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1056606001 is a deficient number, since it is larger than the sum of its proper divisors (107006211).
1056606001 is a wasteful number, since it uses less digits than its factorization.
1056606001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16704 (or 16693 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 25.
The square root of 1056606001 is about 32505.4764770492. The cubic root of 1056606001 is about 1018.5234309353.
The spelling of 1056606001 in words is "one billion, fifty-six million, six hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •