Search a number
-
+
505506055500601 = 101461107711007971
BaseRepresentation
bin111001011110000010100110…
…0110111101011001100111001
32110021211220111011101210021021
41302330011030313223030321
51012224202400202004401
64551042135335542441
7211322415204462211
oct16274051467531471
92407756434353237
10505506055500601
11137084a068a5a81
124884256322aa21
131890b02a30476c
148cb88a3361241
153d6958c6a02a1
hex1cbc14cdeb339

505506055500601 has 16 divisors (see below), whose sum is σ = 511666472471616. Its totient is φ = 499368497400000.

The previous prime is 505506055500587. The next prime is 505506055500653. The reversal of 505506055500601 is 106005550605505.

It is a cyclic number.

It is not a de Polignac number, because 505506055500601 - 27 = 505506055500473 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 501004546 + ... + 502012516.

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

Almost surely, 2505506055500601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1019304.

The product of its (nonzero) digits is 562500, while the sum is 43.

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

Divisors: 1 101 461 10771 46561 1007971 1087871 4965431 101805071 464674631 501508531 10856855641 46932137731 1096542419741 5005010450501 505506055500601