Search a number
-
+
113003110013 is a prime number
BaseRepresentation
bin110100100111110000…
…0101001111001111101
3101210200101021202211212
41221033200221321331
53322412244010023
6123525104454205
711110215405143
oct1511740517175
9353611252755
10113003110013
1143a19345112
1219a9861a365
13a86b72cb91
14567dd99593
152e15aa2e78
hex1a4f829e7d

113003110013 has 2 divisors, whose sum is σ = 113003110014. Its totient is φ = 113003110012.

The previous prime is 113003110009. The next prime is 113003110049. The reversal of 113003110013 is 310011300311.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 91374407524 + 21628702489 = 302282^2 + 147067^2 .

It is a cyclic number.

It is not a de Polignac number, because 113003110013 - 22 = 113003110009 is a prime.

It is a super-2 number, since 2×1130031100132 (a number of 23 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 113003110013.

It is a congruent number.

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

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

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

Almost surely, 2113003110013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 14.

Adding to 113003110013 its reverse (310011300311), we get a palindrome (423014410324).

The spelling of 113003110013 in words is "one hundred thirteen billion, three million, one hundred ten thousand, thirteen".