Search a number
-
+
103301111301 = 3611493788503
BaseRepresentation
bin110000000110100111…
…0011101111000000101
3100212122020021011122020
41200031032131320011
53143030041030201
6115242245153353
710314616646463
oct1401516357005
9325566234566
10103301111301
113a89a869963
121802b3bb859
1399836c083b
144ddd649833
152a48e5ba36
hex180d39de05

103301111301 has 16 divisors (see below), whose sum is σ = 140932348800. Its totient is φ = 67283795520.

The previous prime is 103301111273. The next prime is 103301111311. The reversal of 103301111301 is 103111103301.

It is not a de Polignac number, because 103301111301 - 230 = 102227369477 is a prime.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1866985 + ... + 1921518.

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

Almost surely, 2103301111301 is an apocalyptic number.

It is an amenable number.

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

103301111301 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 3788716.

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

Adding to 103301111301 its reverse (103111103301), we get a palindrome (206412214602).

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

Divisors: 1 3 61 149 183 447 9089 27267 3788503 11365509 231098683 564486947 693296049 1693460841 34433703767 103301111301