Base | Representation |
---|---|
bin | 11001110001000001101011… |
… | …100010000001110010101101 |
3 | 112212020022022001112111100212 |
4 | 121301001223202001302231 |
5 | 104323114303113020023 |
6 | 1041002331351232205 |
7 | 32604054502320443 |
oct | 3161015342016255 |
9 | 485208261474325 |
10 | 113320221220013 |
11 | 3311a921699045 |
12 | 10862274978665 |
13 | 4b300880b16b2 |
14 | 1ddaa297a8b93 |
15 | d17abb9cce78 |
hex | 67106b881cad |
113320221220013 has 32 divisors (see below), whose sum is σ = 115500697804800. Its totient is φ = 111157539192000.
The previous prime is 113320221220001. The next prime is 113320221220021. The reversal of 113320221220013 is 310022122023311.
It is a cyclic number.
It is not a de Polignac number, because 113320221220013 - 212 = 113320221215917 is a prime.
It is a super-2 number, since 2×1133202212200132 (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 (113320221226013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 43736093348 + ... + 43736095938.
It is an arithmetic number, because the mean of its divisors is an integer number (3609396806400).
Almost surely, 2113320221220013 is an apocalyptic number.
It is an amenable number.
113320221220013 is a deficient number, since it is larger than the sum of its proper divisors (2180476584787).
113320221220013 is a wasteful number, since it uses less digits than its factorization.
113320221220013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5849.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 113320221220013 its reverse (310022122023311), we get a palindrome (423342343243324).
The spelling of 113320221220013 in words is "one hundred thirteen trillion, three hundred twenty billion, two hundred twenty-one million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •