Search a number
-
+
2303400469 is a prime number
BaseRepresentation
bin1000100101001011…
…0001101000010101
312221112020212102111
42021102301220111
514204132303334
61020321511021
7111036403156
oct21122615025
95845225374
102303400469
11a82233957
125434a2471
132a9295b76
1417bcb592d
15d7344064
hex894b1a15

2303400469 has 2 divisors, whose sum is σ = 2303400470. Its totient is φ = 2303400468.

The previous prime is 2303400383. The next prime is 2303400493. The reversal of 2303400469 is 9640043032.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2268140625 + 35259844 = 47625^2 + 5938^2 .

It is a cyclic number.

It is not a de Polignac number, because 2303400469 - 29 = 2303399957 is a prime.

It is a super-2 number, since 2×23034004692 = 10611307441178839922, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 2303400469.

It is a congruent number.

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

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

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

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

Almost surely, 22303400469 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 2303400469 is about 47993.7544790986. The cubic root of 2303400469 is about 1320.6563289863.

The spelling of 2303400469 in words is "two billion, three hundred three million, four hundred thousand, four hundred sixty-nine".