[go: up one dir, main page]

Search a number
-
+
505152157 = 3713652761
BaseRepresentation
bin11110000111000…
…000001010011101
31022012112101111011
4132013000022131
52013304332112
6122043055221
715342502546
oct3607001235
91265471434
10505152157
1123a166324
12121211511
138086a203
144b1374cd
152e534aa7
hex1e1c029d

505152157 has 4 divisors (see below), whose sum is σ = 518804956. Its totient is φ = 491499360.

The previous prime is 505152143. The next prime is 505152187. The reversal of 505152157 is 751251505.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 299774596 + 205377561 = 17314^2 + 14331^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-505152157 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2505152157 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13652798.

The product of its (nonzero) digits is 8750, while the sum is 31.

The square root of 505152157 is about 22475.5902480891. The cubic root of 505152157 is about 796.4173952325.

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

Divisors: 1 37 13652761 505152157