Search a number
-
+
505500051 = 37101238331
BaseRepresentation
bin11110001000010…
…101000110010011
31022020012001201010
4132020111012103
52013402000201
6122054342003
715345452040
oct3610250623
91266161633
10505500051
1123a383741
1212135a903
138095c674
144b1c81c7
152e5a2bd6
hex1e215193

505500051 has 16 divisors (see below), whose sum is σ = 777915648. Its totient is φ = 285996000.

The previous prime is 505500041. The next prime is 505500067. The reversal of 505500051 is 150005505.

It is not a de Polignac number, because 505500051 - 27 = 505499923 is a prime.

It is a super-2 number, since 2×5055000512 = 511060603122005202, which contains 22 as substring.

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

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

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

Almost surely, 2505500051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 238442.

The product of its (nonzero) digits is 625, while the sum is 21.

The square root of 505500051 is about 22483.3282900909. The cubic root of 505500051 is about 796.6001819096.

Adding to 505500051 its reverse (150005505), we get a palindrome (655505556).

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

Divisors: 1 3 7 21 101 303 707 2121 238331 714993 1668317 5004951 24071431 72214293 168500017 505500051