Search a number
-
+
10997683259 is a prime number
BaseRepresentation
bin10100011111000001…
…10101010000111011
31001101110002012021012
422033200311100323
5140010401331014
65015142304135
7536350523333
oct121740652073
931343065235
1010997683259
1147339a6232
12216b12804b
1310635c5cb4
1476486a0c3
15445782c3e
hex28f83543b

10997683259 has 2 divisors, whose sum is σ = 10997683260. Its totient is φ = 10997683258.

The previous prime is 10997683241. The next prime is 10997683331. The reversal of 10997683259 is 95238679901.

10997683259 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 is a cyclic number.

It is not a de Polignac number, because 10997683259 - 28 = 10997683003 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 10997683198 and 10997683207.

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

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

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

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

Almost surely, 210997683259 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 7348320, while the sum is 59.

The spelling of 10997683259 in words is "ten billion, nine hundred ninety-seven million, six hundred eighty-three thousand, two hundred fifty-nine".