Search a number
-
+
106316022769 = 1136972614307
BaseRepresentation
bin110001100000011101…
…1011100001111110001
3101011102100100112122221
41203000323130033301
53220213400212034
6120501345201041
710452416166025
oct1430073341761
9334370315587
10106316022769
11410a7694530
1218731030181
13a0441c6318
145207c14385
152b73998bb4
hex18c0edc3f1

106316022769 has 8 divisors (see below), whose sum is σ = 116012531808. Its totient is φ = 96624749760.

The previous prime is 106316022749. The next prime is 106316022809. The reversal of 106316022769 is 967220613601.

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

It is not a de Polignac number, because 106316022769 - 211 = 106316020721 is a prime.

It is a super-2 number, since 2×1063160227692 (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 (106316022749) 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, 1266487 + ... + 1347820.

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

Almost surely, 2106316022769 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2618015.

The product of its (nonzero) digits is 163296, while the sum is 43.

The spelling of 106316022769 in words is "one hundred six billion, three hundred sixteen million, twenty-two thousand, seven hundred sixty-nine".

Divisors: 1 11 3697 40667 2614307 28757377 9665092979 106316022769