Search a number
-
+
1000694693861 = 1168985609949
BaseRepresentation
bin11101000111111100000…
…11010011111111100101
310112122222010121112022022
432203332003103333211
5112343410320200421
62043413544112525
7132204101360402
oct16437603237745
93478863545268
101000694693861
11356435080755
12141b36765745
137349919a9b5
14366107dd2a9
151b06c73b7ab
hexe8fe0d3fe5

1000694693861 has 4 divisors (see below), whose sum is σ = 1000780315500. Its totient is φ = 1000609072224.

The previous prime is 1000694693851. The next prime is 1000694693917. The reversal of 1000694693861 is 1683964960001.

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

It can be written as a sum of positive squares in 2 ways, for example, as 896184088900 + 104510604961 = 946670^2 + 323281^2 .

It is a cyclic number.

It is not a de Polignac number, because 1000694693861 - 26 = 1000694693797 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 21000694693861 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 85621638.

The product of its (nonzero) digits is 1679616, while the sum is 53.

The spelling of 1000694693861 in words is "one trillion, six hundred ninety-four million, six hundred ninety-three thousand, eight hundred sixty-one".

Divisors: 1 11689 85609949 1000694693861