Search a number
-
+
1066560005001 = 3355520001667
BaseRepresentation
bin11111000010100111110…
…11100010001110001001
310202221222101211000100110
433201103323202032021
5114433303330130001
62133545414224533
7140025231313521
oct17412373421611
93687871730313
101066560005001
11381364354897
12152858955149
1379764b25b9a
143989c240681
151cb24d6e3d6
hexf853ee2389

1066560005001 has 4 divisors (see below), whose sum is σ = 1422080006672. Its totient is φ = 711040003332.

The previous prime is 1066560004907. The next prime is 1066560005029. The reversal of 1066560005001 is 1005000656601.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 1066560005001 - 219 = 1066559480713 is a prime.

It is a super-2 number, since 2×10665600050012 (a number of 25 digits) contains 22 as substring.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 1066560005001.

It is not an unprimeable number, because it can be changed into a prime (1066560003001) 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, 177760000831 + ... + 177760000836.

It is an arithmetic number, because the mean of its divisors is an integer number (355520001668).

Almost surely, 21066560005001 is an apocalyptic number.

It is an amenable number.

1066560005001 is a deficient number, since it is larger than the sum of its proper divisors (355520001671).

1066560005001 is an equidigital number, since it uses as much as digits as its factorization.

1066560005001 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 355520001670.

The product of its (nonzero) digits is 5400, while the sum is 30.

The spelling of 1066560005001 in words is "one trillion, sixty-six billion, five hundred sixty million, five thousand, one".

Divisors: 1 3 355520001667 1066560005001