Base | Representation |
---|---|
bin | 11001110001001100110000… |
… | …110100111011101111011111 |
3 | 112212021110000101111020101022 |
4 | 121301030300310323233133 |
5 | 104323313141013101421 |
6 | 1041012020245434355 |
7 | 32604655420551221 |
oct | 3161146064735737 |
9 | 485243011436338 |
10 | 113332121222111 |
11 | 3312497895a820 |
12 | 1086463610b9bb |
13 | 4b3123360365c |
14 | 1ddb437dd6411 |
15 | d180665997ab |
hex | 671330d3bbdf |
113332121222111 has 16 divisors (see below), whose sum is σ = 124556170348800. Its totient is φ = 102264003678720.
The previous prime is 113332121222077. The next prime is 113332121222161. The reversal of 113332121222111 is 111222121233311.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113332121222111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113332121222161) 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, 59311211 + ... + 61192188.
It is an arithmetic number, because the mean of its divisors is an integer number (7784760646800).
Almost surely, 2113332121222111 is an apocalyptic number.
113332121222111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
113332121222111 is a deficient number, since it is larger than the sum of its proper divisors (11224049126689).
113332121222111 is a wasteful number, since it uses less digits than its factorization.
113332121222111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120504046.
The product of its digits is 864, while the sum is 26.
Adding to 113332121222111 its reverse (111222121233311), we get a palindrome (224554242455422).
The spelling of 113332121222111 in words is "one hundred thirteen trillion, three hundred thirty-two billion, one hundred twenty-one million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •