Search a number
-
+
10115321355077 is a prime number
BaseRepresentation
bin1001001100110010100000…
…1000101101101101000101
31022211000102010201002001112
42103030220020231231011
52311212134231330302
633302525305534405
72062544043603431
oct223145010555505
938730363632045
1010115321355077
11324a97a220a44
1211745007a4405
13584b41c4ac33
1426d826d459c1
151281c92bd552
hex9332822db45

10115321355077 has 2 divisors, whose sum is σ = 10115321355078. Its totient is φ = 10115321355076.

The previous prime is 10115321354977. The next prime is 10115321355091. The reversal of 10115321355077 is 77055312351101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7606420584676 + 2508900770401 = 2757974^2 + 1583951^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×101153213550772 (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 (10115321355277) by changing a digit.

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

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

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

Almost surely, 210115321355077 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 110250, while the sum is 41.

The spelling of 10115321355077 in words is "ten trillion, one hundred fifteen billion, three hundred twenty-one million, three hundred fifty-five thousand, seventy-seven".