Search a number
-
+
2025402150433 is a prime number
BaseRepresentation
bin11101011110010011011…
…000000010111000100001
321011121220202110210110111
4131132103120002320201
5231141010422303213
64150242405131321
7266221232135464
oct35362330027041
97147822423414
102025402150433
11710a71791442
122886530b9b41
13118cc11b2c0c
147005c3db2db
1537a4313aa3d
hex1d793602e21

2025402150433 has 2 divisors, whose sum is σ = 2025402150434. Its totient is φ = 2025402150432.

The previous prime is 2025402150419. The next prime is 2025402150451. The reversal of 2025402150433 is 3340512045202.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1842827970064 + 182574180369 = 1357508^2 + 427287^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 22025402150433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28800, while the sum is 31.

Adding to 2025402150433 its reverse (3340512045202), we get a palindrome (5365914195635).

The spelling of 2025402150433 in words is "two trillion, twenty-five billion, four hundred two million, one hundred fifty thousand, four hundred thirty-three".