Search a number
-
+
506005500551 = 1015009955451
BaseRepresentation
bin1110101110100000100…
…01110011001010000111
31210101002101121202020212
413113100101303022013
531242244402004201
61024242233550035
751362200534325
oct7272021631207
91711071552225
10506005500551
11185660a059a1
128209827531b
13389403c13b5
141a6c2a64d15
15d267ea5abb
hex75d0473287

506005500551 has 4 divisors (see below), whose sum is σ = 511015456104. Its totient is φ = 500995545000.

The previous prime is 506005500547. The next prime is 506005500587. The reversal of 506005500551 is 155005500605.

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 506005500551 - 22 = 506005500547 is a prime.

It is a super-2 number, since 2×5060055005512 (a number of 24 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 (506005500751) 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, 2504977625 + ... + 2504977826.

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

Almost surely, 2506005500551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5009955552.

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

The spelling of 506005500551 in words is "five hundred six billion, five million, five hundred thousand, five hundred fifty-one".

Divisors: 1 101 5009955451 506005500551