Base | Representation |
---|---|
bin | 11001010011101000010100… |
… | …000111100000110100101000 |
3 | 112121002012001201202000000001 |
4 | 121103220110013200310220 |
5 | 104042020121211203222 |
6 | 1032414322543552344 |
7 | 32305111505414434 |
oct | 3123502407406450 |
9 | 477065051660001 |
10 | 111300120022312 |
11 | 32511130189981 |
12 | 10596860bbb6b4 |
13 | 4a147301cca00 |
14 | 1d6ad5140d9c4 |
15 | cd0288e44e27 |
hex | 653a141e0d28 |
111300120022312 has 48 divisors (see below), whose sum is σ = 235800485886240. Its totient is φ = 49135838925888.
The previous prime is 111300120022297. The next prime is 111300120022387. The reversal of 111300120022312 is 213220021003111.
It is a self number, because there is not a number n which added to its sum of digits gives 111300120022312.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1789590078 + ... + 1789652269.
It is an arithmetic number, because the mean of its divisors is an integer number (4912510122630).
Almost surely, 2111300120022312 is an apocalyptic number.
It is an amenable number.
111300120022312 is an abundant number, since it is smaller than the sum of its proper divisors (124500365863928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111300120022312 is a wasteful number, since it uses less digits than its factorization.
111300120022312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3579242402 (or 3579242385 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 111300120022312 its reverse (213220021003111), we get a palindrome (324520141025423).
The spelling of 111300120022312 in words is "one hundred eleven trillion, three hundred billion, one hundred twenty million, twenty-two thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •