Base | Representation |
---|---|
bin | 10111011100011100111100… |
… | …111000001000010011010111 |
3 | 111112002020201011210110011002 |
4 | 113130130330320020103113 |
5 | 102003324344103101403 |
6 | 1003144115104133515 |
7 | 30501321246256340 |
oct | 2734347470102327 |
9 | 445066634713132 |
10 | 103110301222103 |
11 | 2a943918a6164a |
12 | b69357330729b |
13 | 456c34b6aab76 |
14 | 1b667cacdd0c7 |
15 | bdc2077ac188 |
hex | 5dc73ce084d7 |
103110301222103 has 16 divisors (see below), whose sum is σ = 118089190855680. Its totient is φ = 88193820024576.
The previous prime is 103110301222091. The next prime is 103110301222109. The reversal of 103110301222103 is 301222103011301.
It is a happy number.
It is not a de Polignac number, because 103110301222103 - 26 = 103110301222039 is a prime.
It is a super-2 number, since 2×1031103012221032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103110301222109) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1910051 + ... + 14486852.
It is an arithmetic number, because the mean of its divisors is an integer number (7380574428480).
Almost surely, 2103110301222103 is an apocalyptic number.
103110301222103 is a deficient number, since it is larger than the sum of its proper divisors (14978889633577).
103110301222103 is an equidigital number, since it uses as much as digits as its factorization.
103110301222103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16398806.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 103110301222103 its reverse (301222103011301), we get a palindrome (404332404233404).
The spelling of 103110301222103 in words is "one hundred three trillion, one hundred ten billion, three hundred one million, two hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •