Search a number
-
+
5515601110151 = 11501418282741
BaseRepresentation
bin101000001000011001101…
…1100011110010010000111
3201112021201201120100110012
41100100303130132102013
51210331422341011101
615421455425420435
71106326510612616
oct120206334362207
921467651510405
105515601110151
111837176042a20
12750b6379a71b
13310171455062
14150d5698587d
1598717d05bbb
hex5043371e487

5515601110151 has 4 divisors (see below), whose sum is σ = 6017019392904. Its totient is φ = 5014182827400.

The previous prime is 5515601110147. The next prime is 5515601110163. The reversal of 5515601110151 is 1510111065155.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 5515601110151 - 22 = 5515601110147 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5515601110121) 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 3 ways as a sum of consecutive naturals, for example, 250709141360 + ... + 250709141381.

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

Almost surely, 25515601110151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 501418282752.

The product of its (nonzero) digits is 3750, while the sum is 32.

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

Divisors: 1 11 501418282741 5515601110151