Search a number
-
+
4050298472569 is a prime number
BaseRepresentation
bin111010111100001000100…
…110100000100001111001
3112100012112021010211221121
4322330020212200201321
51012330002402110234
612340403104505241
7565424112654226
oct72741046404171
915305467124847
104050298472569
1113217a3995568
12554b8491b221
13234c3164cc3b
1410006d56694d
1570556b5b4b4
hex3af089a0879

4050298472569 has 2 divisors, whose sum is σ = 4050298472570. Its totient is φ = 4050298472568.

The previous prime is 4050298472537. The next prime is 4050298472587. The reversal of 4050298472569 is 9652748920504.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2646357858169 + 1403940614400 = 1626763^2 + 1184880^2 .

It is a cyclic number.

It is not a de Polignac number, because 4050298472569 - 25 = 4050298472537 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (4050298479569) 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, 2025149236284 + 2025149236285.

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

Almost surely, 24050298472569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 43545600, while the sum is 61.

The spelling of 4050298472569 in words is "four trillion, fifty billion, two hundred ninety-eight million, four hundred seventy-two thousand, five hundred sixty-nine".