Search a number
-
+
1063946916065 = 51119344489383
BaseRepresentation
bin11110111101110000010…
…11011001000011100001
310202201020021211100012202
433132320023121003201
5114412430402303230
62132434230502545
7136603411366445
oct17367013310341
93681207740182
101063946916065
1138024332a460
12152249804a55
137943964c407
14396d1192825
151ca20755a45
hexf7b82d90e1

1063946916065 has 8 divisors (see below), whose sum is σ = 1392803235648. Its totient is φ = 773779575280.

The previous prime is 1063946916061. The next prime is 1063946916073. The reversal of 1063946916065 is 5606196493601.

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

It is not a de Polignac number, because 1063946916065 - 22 = 1063946916061 is a prime.

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

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

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

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

Almost surely, 21063946916065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 19344489399.

The product of its (nonzero) digits is 6298560, while the sum is 56.

The spelling of 1063946916065 in words is "one trillion, sixty-three billion, nine hundred forty-six million, nine hundred sixteen thousand, sixty-five".

Divisors: 1 5 11 55 19344489383 96722446915 212789383213 1063946916065