Search a number
-
+
13022210321269 is a prime number
BaseRepresentation
bin1011110101111111100000…
…1110000110101101110101
31201002220121020010202021221
42331133320032012231311
53201323441320240034
643410153144510341
72512552340252542
oct275377016065565
951086536122257
1013022210321269
114170763268906
12156395ba7b3b1
13735cb2269556
143303c7ab3bc9
15178b0e4acbb4
hexbd7f8386b75

13022210321269 has 2 divisors, whose sum is σ = 13022210321270. Its totient is φ = 13022210321268.

The previous prime is 13022210321231. The next prime is 13022210321273. The reversal of 13022210321269 is 96212301222031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7510806142225 + 5511404179044 = 2740585^2 + 2347638^2 .

It is a cyclic number.

It is not a de Polignac number, because 13022210321269 - 215 = 13022210288501 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 213022210321269 is an apocalyptic number.

It is an amenable number.

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

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

13022210321269 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 34.

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