Search a number
-
+
6655071015111 = 36991973172721
BaseRepresentation
bin110000011011000000100…
…1001001101000011000111
3212120012220100020000222210
41200312001021031003013
51333014041134440421
622053144124154503
71254545602161441
oct140660111150307
925505810200883
106655071015111
1121364440aa782
128b5969998a33
1339375552147c
1419017006d491
15b81a897d576
hex60d8124d0c7

6655071015111 has 8 divisors (see below), whose sum is σ = 8873443507824. Its totient is φ = 4436706266240.

The previous prime is 6655071015097. The next prime is 6655071015121. The reversal of 6655071015111 is 1115101705566.

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

It is a cyclic number.

It is not a de Polignac number, because 6655071015111 - 210 = 6655071014087 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 6655071015111.

It is a congruent number.

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

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

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

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

Almost surely, 26655071015111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3871921.

The product of its (nonzero) digits is 31500, while the sum is 39.

The spelling of 6655071015111 in words is "six trillion, six hundred fifty-five billion, seventy-one million, fifteen thousand, one hundred eleven".

Divisors: 1 3 699197 2097591 3172721 9518163 2218357005037 6655071015111