Search a number
-
+
10152362263033 is a prime number
BaseRepresentation
bin1001001110111100011111…
…1100100100000111111001
31022221120000120201011101101
42103233013330210013321
52312314014214404113
633331533021051401
72065325000250634
oct223570774440771
938846016634341
1010152362263033
11326465790a371
12117b7196b6b61
13588495c3cb53
1427153c518c1b
151291460e22dd
hex93bc7f241f9

10152362263033 has 2 divisors, whose sum is σ = 10152362263034. Its totient is φ = 10152362263032.

The previous prime is 10152362262971. The next prime is 10152362263079. The reversal of 10152362263033 is 33036226325101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9939063306384 + 213298956649 = 3152628^2 + 461843^2 .

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 10152362262983 and 10152362263001.

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

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

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

Almost surely, 210152362263033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 116640, while the sum is 37.

Adding to 10152362263033 its reverse (33036226325101), we get a palindrome (43188588588134).

The spelling of 10152362263033 in words is "ten trillion, one hundred fifty-two billion, three hundred sixty-two million, two hundred sixty-three thousand, thirty-three".