Search a number
-
+
1068020643751 = 19352671593887
BaseRepresentation
bin11111000101010101111…
…11011011011110100111
310210002202012021011000221
433202222333123132213
5114444301241100001
62134350352545211
7140106355453525
oct17425277333647
93702665234027
101068020643751
11381a438a0356
12152ba5b52207
1379938616279
143999a219315
151cbad1e11a1
hexf8aafdb7a7

1068020643751 has 8 divisors (see below), whose sum is σ = 1124264839680. Its totient is φ = 1011779706168.

The previous prime is 1068020643737. The next prime is 1068020643763. The reversal of 1068020643751 is 1573460208601.

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

It is a cyclic number.

It is not a de Polignac number, because 1068020643751 - 27 = 1068020643623 is a prime.

It is a super-2 number, since 2×10680206437512 (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 = 1068020643698 and 1068020643707.

It is a congruent number.

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

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

Almost surely, 21068020643751 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1629173.

The product of its (nonzero) digits is 241920, while the sum is 43.

The spelling of 1068020643751 in words is "one trillion, sixty-eight billion, twenty million, six hundred forty-three thousand, seven hundred fifty-one".

Divisors: 1 19 35267 670073 1593887 30283853 56211612829 1068020643751