Base | Representation |
---|---|
bin | 11001101110010011100111… |
… | …011011000111011111010111 |
3 | 112211120102212200012212102001 |
4 | 121232103213123013133113 |
5 | 104312034020213101403 |
6 | 1040340421423500131 |
7 | 32554420110462400 |
oct | 3156234733073727 |
9 | 484512780185361 |
10 | 113133321222103 |
11 | 330586324a5356 |
12 | 10831bb4457647 |
13 | 4b18570aa8960 |
14 | 1dd19794449a7 |
15 | d12ccd660c1d |
hex | 66e4e76c77d7 |
113133321222103 has 48 divisors (see below), whose sum is σ = 150117943943520. Its totient is φ = 84216583471104.
The previous prime is 113133321222091. The next prime is 113133321222107. The reversal of 113133321222103 is 301222123331311.
It is not a de Polignac number, because 113133321222103 - 241 = 110934297966551 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113133321222107) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 28490103 + ... + 32217271.
It is an arithmetic number, because the mean of its divisors is an integer number (3127457165490).
Almost surely, 2113133321222103 is an apocalyptic number.
113133321222103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
113133321222103 is a deficient number, since it is larger than the sum of its proper divisors (36984622721417).
113133321222103 is a wasteful number, since it uses less digits than its factorization.
113133321222103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3730016 (or 3730009 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 113133321222103 its reverse (301222123331311), we get a palindrome (414355444553414).
The spelling of 113133321222103 in words is "one hundred thirteen trillion, one hundred thirty-three billion, three hundred twenty-one million, two hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •