Search a number
-
+
106006510065 = 357067100671
BaseRepresentation
bin110001010111001111…
…0101111100111110001
3101010121202221200001110
41202232132233213301
53214100131310230
6120410531223533
710441640316441
oct1425636574761
9333552850043
10106006510065
1140a58a03005
1218665447ba9
139cc5047701
1451b8a86121
152b5670b4b0
hex18ae7af9f1

106006510065 has 8 divisors (see below), whose sum is σ = 169610416128. Its totient is φ = 56536805360.

The previous prime is 106006510063. The next prime is 106006510079. The reversal of 106006510065 is 560015600601.

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

It is not a de Polignac number, because 106006510065 - 21 = 106006510063 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (106006510063) 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, 3533550321 + ... + 3533550350.

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

Almost surely, 2106006510065 is an apocalyptic number.

106006510065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 7067100679.

The product of its (nonzero) digits is 5400, while the sum is 30.

The spelling of 106006510065 in words is "one hundred six billion, six million, five hundred ten thousand, sixty-five".

Divisors: 1 3 5 15 7067100671 21201302013 35335503355 106006510065