Search a number
-
+
106316632569 = 375062696789
BaseRepresentation
bin110001100000011110…
…1110001000111111001
3101011102101111112011010
41203000331301013321
53220214024220234
6120501410224133
710452424315620
oct1430075610771
9334371445133
10106316632569
11410a7a706a4
1218731285049
13a04437aa54
145207d326b7
152b73a696e9
hex18c0f711f9

106316632569 has 8 divisors (see below), whose sum is σ = 162006297280. Its totient is φ = 60752361456.

The previous prime is 106316632523. The next prime is 106316632589. The reversal of 106316632569 is 965236613601.

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

It is not a de Polignac number, because 106316632569 - 215 = 106316599801 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (106316632589) 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 7 ways as a sum of consecutive naturals, for example, 2531348374 + ... + 2531348415.

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

Almost surely, 2106316632569 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5062696799.

The product of its (nonzero) digits is 1049760, while the sum is 48.

The spelling of 106316632569 in words is "one hundred six billion, three hundred sixteen million, six hundred thirty-two thousand, five hundred sixty-nine".

Divisors: 1 3 7 21 5062696789 15188090367 35438877523 106316632569