Search a number
-
+
152010569 = 823184703
BaseRepresentation
bin10010000111101…
…11111101001001
3101121000221022002
421003313331021
5302403314234
623030040345
73524032334
oct1103677511
9347027262
10152010569
1178895877
1242aa90b5
13256540a9
141628d61b
15d52a27e
hex90f7f49

152010569 has 4 divisors (see below), whose sum is σ = 152196096. Its totient is φ = 151825044.

The previous prime is 152010557. The next prime is 152010587. The reversal of 152010569 is 965010251.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 965010251 = 4720532133.

It is a cyclic number.

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

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

It is a Duffinian number.

It is a Curzon number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91529 + ... + 93174.

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

Almost surely, 2152010569 is an apocalyptic number.

It is an amenable number.

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

152010569 is an equidigital number, since it uses as much as digits as its factorization.

152010569 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 185526.

The product of its (nonzero) digits is 2700, while the sum is 29.

The square root of 152010569 is about 12329.2566280372. The cubic root of 152010569 is about 533.6926989038.

The spelling of 152010569 in words is "one hundred fifty-two million, ten thousand, five hundred sixty-nine".

Divisors: 1 823 184703 152010569