Search a number
-
+
5505345150251 = 46311890594277
BaseRepresentation
bin101000000011101000000…
…1001000101110100101011
3201111022020222011121100112
41100013100021011310223
51210144421324302001
615413042020524535
71105514404444112
oct120072011056453
921438228147315
105505345150251
1118328928a4501
1274ab80b5074b
1330c1c871952b
14150662834c79
1598317737cbb
hex501d0245d2b

5505345150251 has 4 divisors (see below), whose sum is σ = 5517235744992. Its totient is φ = 5493454555512.

The previous prime is 5505345150247. The next prime is 5505345150299. The reversal of 5505345150251 is 1520515435055.

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 5505345150251 - 22 = 5505345150247 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 5505345150199 and 5505345150208.

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

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

Almost surely, 25505345150251 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11890594740.

The product of its (nonzero) digits is 375000, while the sum is 41.

The spelling of 5505345150251 in words is "five trillion, five hundred five billion, three hundred forty-five million, one hundred fifty thousand, two hundred fifty-one".

Divisors: 1 463 11890594277 5505345150251