Search a number
-
+
1059742590967 = 1624996521533
BaseRepresentation
bin11110110101111011001…
…01001010011111110111
310202022101021122111102101
433122331211022133313
5114330323100402332
62130501121322531
7136364260253044
oct17327545123767
93668337574371
101059742590967
11379486079815
12151475796447
1378c195bab98
1439412a521cb
151c8765beae7
hexf6bd94a7f7

1059742590967 has 4 divisors (see below), whose sum is σ = 1059749275000. Its totient is φ = 1059735906936.

The previous prime is 1059742590887. The next prime is 1059742590971. The reversal of 1059742590967 is 7690952479501.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1059742590967 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 21059742590967 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6684032.

The product of its (nonzero) digits is 42865200, while the sum is 64.

The spelling of 1059742590967 in words is "one trillion, fifty-nine billion, seven hundred forty-two million, five hundred ninety thousand, nine hundred sixty-seven".

Divisors: 1 162499 6521533 1059742590967