Search a number
-
+
103301111113 = 463223112551
BaseRepresentation
bin110000000110100111…
…0011101110101001001
3100212122020021011101021
41200031032131311021
53143030041023423
6115242245152441
710314616646104
oct1401516356511
9325566234337
10103301111113
113a89a869802
121802b3bb721
1399836c0725
144ddd64973b
152a48e5b95d
hex180d39dd49

103301111113 has 4 divisors (see below), whose sum is σ = 103524224128. Its totient is φ = 103077998100.

The previous prime is 103301111101. The next prime is 103301111129. The reversal of 103301111113 is 311111103301.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 103301111113 - 213 = 103301102921 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (103301211113) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111555813 + ... + 111556738.

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

Almost surely, 2103301111113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 223113014.

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

Adding to 103301111113 its reverse (311111103301), we get a palindrome (414412214414).

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

Divisors: 1 463 223112551 103301111113