Search a number
-
+
1068812635407 = 31132388261679
BaseRepresentation
bin11111000110110100011…
…00101000110100001111
310210011210101112111100020
433203122030220310033
5120002412013313112
62135001124033223
7140135113334226
oct17433214506417
93704711474306
101068812635407
1138230a961410
12153187232813
1379a33723c9a
1439a3349bcbd
151cc079d548c
hexf8da328d0f

1068812635407 has 8 divisors (see below), whose sum is σ = 1554636560640. Its totient is φ = 647765233560.

The previous prime is 1068812635403. The next prime is 1068812635427. The reversal of 1068812635407 is 7045362188601.

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

It is not a de Polignac number, because 1068812635407 - 22 = 1068812635403 is a prime.

It is a super-2 number, since 2×10688126354072 (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 1068812635407.

It is a congruent number.

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

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

Almost surely, 21068812635407 is an apocalyptic number.

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

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

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

The sum of its prime factors is 32388261693.

The product of its (nonzero) digits is 1935360, while the sum is 51.

The spelling of 1068812635407 in words is "one trillion, sixty-eight billion, eight hundred twelve million, six hundred thirty-five thousand, four hundred seven".

Divisors: 1 3 11 33 32388261679 97164785037 356270878469 1068812635407