Search a number
-
+
550060115061 = 3533459497579
BaseRepresentation
bin10000000000100100010…
…00110100010001110101
31221120210122011001020010
420000102020310101311
533003010342140221
61100405533130433
754512000555562
oct10002210642165
91846718131203
10550060115061
111a230865a916
128a732029a19
133cb414a7c32
141c8a1921869
15e4958eec76
hex8012234475

550060115061 has 8 divisors (see below), whose sum is σ = 747251477280. Its totient is φ = 359787748112.

The previous prime is 550060115039. The next prime is 550060115119. The reversal of 550060115061 is 160511060055.

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 550060115061 - 25 = 550060115029 is a prime.

It is a super-2 number, since 2×5500601150612 (a number of 24 digits) contains 22 as substring.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 2550060115061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3459497635.

The product of its (nonzero) digits is 4500, while the sum is 30.

The spelling of 550060115061 in words is "five hundred fifty billion, sixty million, one hundred fifteen thousand, sixty-one".

Divisors: 1 3 53 159 3459497579 10378492737 183353371687 550060115061