Search a number
-
+
23321102269 is a prime number
BaseRepresentation
bin10101101110000010…
…111100011110111101
32020012021202202002111
4111232002330132331
5340230200233034
614414044054021
71453630045543
oct255602743675
966167682074
1023321102269
119988177343
12462a234311
132278767cca
1411b33d5d93
159175db364
hex56e0bc7bd

23321102269 has 2 divisors, whose sum is σ = 23321102270. Its totient is φ = 23321102268.

The previous prime is 23321102267. The next prime is 23321102281. The reversal of 23321102269 is 96220112332.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 22204874169 + 1116228100 = 149013^2 + 33410^2 .

It is a cyclic number.

It is not a de Polignac number, because 23321102269 - 21 = 23321102267 is a prime.

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

Together with 23321102267, it forms a pair of twin primes.

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

It is a congruent number.

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

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

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

Almost surely, 223321102269 is an apocalyptic number.

It is an amenable number.

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

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

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

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

It can be divided in two parts, 2332 and 1102269, that added together give a square (1104601 = 10512).

The spelling of 23321102269 in words is "twenty-three billion, three hundred twenty-one million, one hundred two thousand, two hundred sixty-nine".