Search a number
-
+
106511155665007 = 1000718541574061
BaseRepresentation
bin11000001101111100001111…
…100110010001100001101111
3111222010100220120102021220111
4120031330033212101201233
5102430034321322240012
61014310314401400451
731302114505131562
oct3015741746214157
9458110816367814
10106511155665007
1130a351446a6285
12bb426aa639127
134757c60881702
141c4324b6564d9
15c4a8ed927ba7
hex60df0f99186f

106511155665007 has 8 divisors (see below), whose sum is σ = 106527730100832. Its totient is φ = 106494582434400.

The previous prime is 106511155664989. The next prime is 106511155665073. The reversal of 106511155665007 is 700566551115601.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-106511155665007 is a prime.

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

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

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

Almost surely, 2106511155665007 is an apocalyptic number.

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

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

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

The sum of its prime factors is 602609.

The product of its (nonzero) digits is 945000, while the sum is 49.

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

Divisors: 1 10007 18541 574061 185539787 5744628427 10643665001 106511155665007