Search a number
-
+
10553151409943 is a prime number
BaseRepresentation
bin1001100110010001100011…
…0101110100111100010111
31101100212112021012100102112
42121210120311310330113
52340400323230104233
634240014551301235
72136303633633542
oct231443065647427
941325467170375
1010553151409943
1133a962593a49a
12122533107a81b
135b7208c0110c
14286abd41d859
151347a1e1c048
hex99918d74f17

10553151409943 has 2 divisors, whose sum is σ = 10553151409944. Its totient is φ = 10553151409942.

The previous prime is 10553151409903. The next prime is 10553151410093. The reversal of 10553151409943 is 34990415135501.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10553151409943 - 28 = 10553151409687 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 210553151409943 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1458000, while the sum is 50.

The spelling of 10553151409943 in words is "ten trillion, five hundred fifty-three billion, one hundred fifty-one million, four hundred nine thousand, nine hundred forty-three".