Search a number
-
+
10152433 is a prime number
BaseRepresentation
bin100110101110…
…100111110001
3201002210112001
4212232213301
510044334213
61001334001
7152202634
oct46564761
921083461
1010152433
115804745
123497301
132146075
1414c3c1b
15d581dd
hex9ae9f1

10152433 has 2 divisors, whose sum is σ = 10152434. Its totient is φ = 10152432.

The previous prime is 10152427. The next prime is 10152437. The reversal of 10152433 is 33425101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7436529 + 2715904 = 2727^2 + 1648^2 .

It is a cyclic number.

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

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

It is not a weakly prime, because it can be changed into another prime (10152437) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5076216 + 5076217.

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

Almost surely, 210152433 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 10152433 is about 3186.2882794876. The cubic root of 10152433 is about 216.5326432155.

Adding to 10152433 its reverse (33425101), we get a palindrome (43577534).

It can be divided in two parts, 10152 and 433, that added together give a triangular number (10585 = T145).

The spelling of 10152433 in words is "ten million, one hundred fifty-two thousand, four hundred thirty-three".