Search a number
-
+
25320116033 is a prime number
BaseRepresentation
bin10111100101001100…
…100100111101000001
32102100121021011110022
4113211030210331001
5403323422203113
615344253543225
71554312302162
oct274514447501
972317234408
1025320116033
11a8135aaa33
124aa77a4b15
1325069584a4
141322ab5769
159d2d56908
hex5e5324f41

25320116033 has 2 divisors, whose sum is σ = 25320116034. Its totient is φ = 25320116032.

The previous prime is 25320116027. The next prime is 25320116071. The reversal of 25320116033 is 33061102352.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 21470161729 + 3849954304 = 146527^2 + 62048^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×253201160332 (a number of 22 digits) contains 22 as substring.

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

It is not a weakly prime, because it can be changed into another prime (25320116933) 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 as a sum of consecutive naturals, namely, 12660058016 + 12660058017.

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

Almost surely, 225320116033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 26.

Adding to 25320116033 its reverse (33061102352), we get a palindrome (58381218385).

The spelling of 25320116033 in words is "twenty-five billion, three hundred twenty million, one hundred sixteen thousand, thirty-three".