Search a number
-
+
1042650987559 = 2345332651633
BaseRepresentation
bin11110010110000101101…
…01110111110000100111
310200200021010210002020221
433023002311313300213
5114040322123100214
62114553125105211
7135220602110356
oct17130265676047
93620233702227
101042650987559
11372205334145
1214a0a5858207
1377424633a9c
1438670b2999d
151c1c5d50e24
hexf2c2d77c27

1042650987559 has 4 divisors (see below), whose sum is σ = 1087983639216. Its totient is φ = 997318335904.

The previous prime is 1042650987517. The next prime is 1042650987589. The reversal of 1042650987559 is 9557890562401.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 1042650987559 - 27 = 1042650987431 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 1042650987497 and 1042650987506.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1042650987509) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22666325794 + ... + 22666325839.

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

Almost surely, 21042650987559 is an apocalyptic number.

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

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

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

The sum of its prime factors is 45332651656.

The product of its (nonzero) digits is 27216000, while the sum is 61.

The spelling of 1042650987559 in words is "one trillion, forty-two billion, six hundred fifty million, nine hundred eighty-seven thousand, five hundred fifty-nine".

Divisors: 1 23 45332651633 1042650987559