Search a number
-
+
106006511157 = 3186911890509
BaseRepresentation
bin110001010111001111…
…0101111111000110101
3101010121202221201112220
41202232132233320311
53214100131324112
6120410531232553
710441640322561
oct1425636577065
9333552851486
10106006511157
1140a58a03908
1218665448759
139cc5048061
1451b8a866a1
152b5670b98c
hex18ae7afe35

106006511157 has 8 divisors (see below), whose sum is σ = 141349651680. Its totient is φ = 70667189040.

The previous prime is 106006511137. The next prime is 106006511167. The reversal of 106006511157 is 751115600601.

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

It is not a de Polignac number, because 106006511157 - 28 = 106006510901 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2106006511157 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1909203.

The product of its (nonzero) digits is 6300, while the sum is 33.

The spelling of 106006511157 in words is "one hundred six billion, six million, five hundred eleven thousand, one hundred fifty-seven".

Divisors: 1 3 18691 56073 1890509 5671527 35335503719 106006511157