Search a number
-
+
505005500050 = 25210100110001
BaseRepresentation
bin1110101100101001010…
…11000110011010010010
31210021111200221110110021
413112110223012122102
531233222402000200
61023555112254054
751325335632062
oct7262453063222
91707450843407
10505005500050
111851984917a7
1281a593a132a
1338811183c1c
141a629d173a2
15d20a2c441a
hex7594ac6692

505005500050 has 12 divisors (see below), whose sum is σ = 939310230186. Its totient is φ = 202002200000.

The previous prime is 505005500039. The next prime is 505005500057. The reversal of 505005500050 is 50005500505.

It can be written as a sum of positive squares in 3 ways, for example, as 301358179521 + 203647320529 = 548961^2 + 451273^2 .

It is a Harshad number since it is a multiple of its sum of digits (25).

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

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

Almost surely, 2505005500050 is an apocalyptic number.

505005500050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

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

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

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

The sum of its prime factors is 10100110013 (or 10100110008 counting only the distinct ones).

The product of its (nonzero) digits is 3125, while the sum is 25.

The spelling of 505005500050 in words is "five hundred five billion, five million, five hundred thousand, fifty".

Divisors: 1 2 5 10 25 50 10100110001 20200220002 50500550005 101001100010 252502750025 505005500050