Search a number
-
+
4003032022469 is a prime number
BaseRepresentation
bin111010010000000111010…
…011010011110111000101
3112011200112011222101211122
4322100013103103313011
51011041202144204334
612302544552443325
7562131602526554
oct72200723236705
915150464871748
104003032022469
111303749243a67
125479933a9545
1323063b01267c
14dba67cbdd9b
156e1dc27732e
hex3a4074d3dc5

4003032022469 has 2 divisors, whose sum is σ = 4003032022470. Its totient is φ = 4003032022468.

The previous prime is 4003032022463. The next prime is 4003032022513. The reversal of 4003032022469 is 9642202303004.

4003032022469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2150607585025 + 1852424437444 = 1466495^2 + 1361038^2 .

It is a cyclic number.

It is not a de Polignac number, because 4003032022469 - 240 = 2903520394693 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 24003032022469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 62208, while the sum is 35.

The spelling of 4003032022469 in words is "four trillion, three billion, thirty-two million, twenty-two thousand, four hundred sixty-nine".