Search a number
-
+
510152157 = 32503112691
BaseRepresentation
bin11110011010000…
…100110111011101
31022112221102012100
4132122010313131
52021044332112
6122342155313
715433136034
oct3632046735
91275842170
10510152157
11241a70959
12122a22b39
13818caca8
144ba7971b
152ebc12dc
hex1e684ddd

510152157 has 12 divisors (see below), whose sum is σ = 738357984. Its totient is φ = 339422280.

The previous prime is 510152143. The next prime is 510152207. The reversal of 510152157 is 751251015.

It is not a de Polignac number, because 510152157 - 222 = 505957853 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 51819 + ... + 60872.

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

Almost surely, 2510152157 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 1750, while the sum is 27.

The square root of 510152157 is about 22586.5481426446. The cubic root of 510152157 is about 799.0364216327.

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

Divisors: 1 3 9 503 1509 4527 112691 338073 1014219 56683573 170050719 510152157