Base | Representation |
---|---|
bin | 11001010011111011000111… |
… | …100010001101100011100101 |
3 | 112121011010011210202202021211 |
4 | 121103323013202031203211 |
5 | 104042332443330342013 |
6 | 1032431502221311421 |
7 | 32306425025454505 |
oct | 3123730742154345 |
9 | 477133153682254 |
10 | 111320310012133 |
11 | 32519750984082 |
12 | 1059a756705571 |
13 | 4a165ca068551 |
14 | 1d6bd08a2da05 |
15 | cd0a6b6de23d |
hex | 653ec788d8e5 |
111320310012133 has 16 divisors (see below), whose sum is σ = 113862989143552. Its totient is φ = 108801063000000.
The previous prime is 111320310012113. The next prime is 111320310012173. The reversal of 111320310012133 is 331210013023111.
It is a cyclic number.
It is not a de Polignac number, because 111320310012133 - 29 = 111320310011621 is a prime.
It is a super-2 number, since 2×1113203100121332 (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 (111320310012113) 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, 46875883 + ... + 49193383.
It is an arithmetic number, because the mean of its divisors is an integer number (7116436821472).
Almost surely, 2111320310012133 is an apocalyptic number.
It is an amenable number.
111320310012133 is a deficient number, since it is larger than the sum of its proper divisors (2542679131419).
111320310012133 is a wasteful number, since it uses less digits than its factorization.
111320310012133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2322556.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 111320310012133 its reverse (331210013023111), we get a palindrome (442530323035244).
The spelling of 111320310012133 in words is "one hundred eleven trillion, three hundred twenty billion, three hundred ten million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •