Search a number
-
+
10113524980063 is a prime number
BaseRepresentation
bin1001001100101011110100…
…0100000101100101011111
31022210211202221111202210121
42103022331010011211133
52311144444343330223
633302031135215411
72062451401634461
oct223127504054537
938724687452717
1010113524980063
11324a13821289a
12117409b077567
13584916a29b3b
1426d6d6534131
1512812172e15d
hex932bd10595f

10113524980063 has 2 divisors, whose sum is σ = 10113524980064. Its totient is φ = 10113524980062.

The previous prime is 10113524980061. The next prime is 10113524980081. The reversal of 10113524980063 is 36008942531101.

10113524980063 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 an emirp because it is prime and its reverse (36008942531101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10113524980063 - 21 = 10113524980061 is a prime.

It is a super-3 number, since 3×101135249800633 (a number of 40 digits) contains 333 as substring.

Together with 10113524980061, it forms a pair of twin primes.

It is a congruent number.

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

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

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

Almost surely, 210113524980063 is an apocalyptic number.

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

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

10113524980063 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 155520, while the sum is 43.

The spelling of 10113524980063 in words is "ten trillion, one hundred thirteen billion, five hundred twenty-four million, nine hundred eighty thousand, sixty-three".