Search a number
-
+
106711040367 = 3246325608601
BaseRepresentation
bin110001101100001111…
…0010100000101101111
3101012102212122111221100
41203120132110011233
53222021011242432
6121004455534143
710465253606601
oct1433036240557
9335385574840
10106711040367
114128a667058
121882138a353
13a0a7cb1b49
14524447d171
152b984c607c
hex18d879416f

106711040367 has 12 divisors (see below), whose sum is σ = 154471087264. Its totient is φ = 70987039200.

The previous prime is 106711040321. The next prime is 106711040369. The reversal of 106711040367 is 763040117601.

It is not a de Polignac number, because 106711040367 - 219 = 106710516079 is a prime.

It is a super-2 number, since 2×1067110403672 (a number of 23 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 (106711040369) by changing a digit.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12800134 + ... + 12808467.

Almost surely, 2106711040367 is an apocalyptic number.

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

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

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

The sum of its prime factors is 25609070 (or 25609067 counting only the distinct ones).

The product of its (nonzero) digits is 21168, while the sum is 36.

Adding to 106711040367 its reverse (763040117601), we get a palindrome (869751157968).

The spelling of 106711040367 in words is "one hundred six billion, seven hundred eleven million, forty thousand, three hundred sixty-seven".

Divisors: 1 3 9 463 1389 4167 25608601 76825803 230477409 11856782263 35570346789 106711040367