Search a number
-
+
505161001 = 17197315061
BaseRepresentation
bin11110000111000…
…010010100101001
31022012112211121201
4132013002110221
52013310123001
6122043204201
715342540412
oct3607022451
91265484551
10505161001
1123a171a34
12121216661
1380871247
144b13a809
152e537501
hex1e1c2529

505161001 has 8 divisors (see below), whose sum is σ = 535182984. Its totient is φ = 475173120.

The previous prime is 505160989. The next prime is 505161043. The reversal of 505161001 is 100161505.

It can be written as a sum of positive squares in 4 ways, for example, as 131125401 + 374035600 = 11451^2 + 19340^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 505161001 - 215 = 505128233 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 505161001.

It is not an unprimeable number, because it can be changed into a prime (505131001) 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, 26011 + ... + 41071.

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

Almost surely, 2505161001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17051.

The product of its (nonzero) digits is 150, while the sum is 19.

The square root of 505161001 is about 22475.7869940076. The cubic root of 505161001 is about 796.4220429901.

The spelling of 505161001 in words is "five hundred five million, one hundred sixty-one thousand, one".

Divisors: 1 17 1973 15061 33541 256037 29715353 505161001