Search a number
-
+
1086204764031 = 32631376685379
BaseRepresentation
bin11111100111001101101…
…10010101111101111111
310211211200110220011121020
433303212312111331333
5120244021404422111
62150555013435223
7141322111104462
oct17634666257577
93754613804536
101086204764031
113897252aa032
1215661b93bb13
137b575a30c5a
143a8032932d9
151d3c4818906
hexfce6d95f7f

1086204764031 has 8 divisors (see below), whose sum is σ = 1453779761280. Its totient is φ = 721383138072.

The previous prime is 1086204764027. The next prime is 1086204764041. The reversal of 1086204764031 is 1304674026801.

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

It is not a de Polignac number, because 1086204764031 - 22 = 1086204764027 is a prime.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 688341901 + ... + 688343478.

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

Almost surely, 21086204764031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1376685645.

The product of its (nonzero) digits is 193536, while the sum is 42.

The spelling of 1086204764031 in words is "one trillion, eighty-six billion, two hundred four million, seven hundred sixty-four thousand, thirty-one".

Divisors: 1 3 263 789 1376685379 4130056137 362068254677 1086204764031