Search a number
-
+
1066635241265 = 51119393368023
BaseRepresentation
bin11111000010110000110…
…10100010011100110001
310202222011122101102002202
433201120122202130301
5114433432110210030
62134001102552545
7140030133646316
oct17413032423461
93688148342082
101066635241265
113813a2871a20
12152879b98755
13797775a8b99
14398a8226d0d
151cb2b781745
hexf8586a2731

1066635241265 has 8 divisors (see below), whose sum is σ = 1396322497728. Its totient is φ = 775734720880.

The previous prime is 1066635241219. The next prime is 1066635241267. The reversal of 1066635241265 is 5621425366601.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 1066635241265 - 214 = 1066635224881 is a prime.

It is a super-2 number, since 2×10666352412652 (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 (1066635241267) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9696683957 + ... + 9696684066.

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

Almost surely, 21066635241265 is an apocalyptic number.

It is an amenable number.

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

1066635241265 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 19393368039.

The product of its (nonzero) digits is 1555200, while the sum is 47.

The spelling of 1066635241265 in words is "one trillion, sixty-six billion, six hundred thirty-five million, two hundred forty-one thousand, two hundred sixty-five".

Divisors: 1 5 11 55 19393368023 96966840115 213327048253 1066635241265