Search a number
-
+
10753585963 is a prime number
BaseRepresentation
bin10100000001111011…
…01011001100101011
31000202102202202201121
422000331223030223
5134010404222323
64535022400111
7530324654401
oct120075531453
930672682647
1010753585963
11461913432a
122101430037
131024b6c223
14740289471
1542e117a5d
hex280f6b32b

10753585963 has 2 divisors, whose sum is σ = 10753585964. Its totient is φ = 10753585962.

The previous prime is 10753585919. The next prime is 10753585987. The reversal of 10753585963 is 36958535701.

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

It is a strong prime.

It is an emirp because it is prime and its reverse (36958535701) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10753585963 is a prime.

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

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

It is not a weakly prime, because it can be changed into another prime (10753585993) 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, 5376792981 + 5376792982.

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

Almost surely, 210753585963 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3402000, while the sum is 52.

The spelling of 10753585963 in words is "ten billion, seven hundred fifty-three million, five hundred eighty-five thousand, nine hundred sixty-three".