Base | Representation |
---|---|
bin | 11001001111011101001100… |
… | …010100011101010100101000 |
3 | 112120001202201202111212112201 |
4 | 121033131030110131110220 |
5 | 104022320214313143422 |
6 | 1032034450034145544 |
7 | 32245306031520211 |
oct | 3117351424352450 |
9 | 476052652455481 |
10 | 111013300131112 |
11 | 324105268a4485 |
12 | 1054b1557222b4 |
13 | 49c3680b84362 |
14 | 1d5b10291c408 |
15 | cc7a9d913727 |
hex | 64f74c51d528 |
111013300131112 has 8 divisors (see below), whose sum is σ = 208149937745850. Its totient is φ = 55506650065552.
The previous prime is 111013300131109. The next prime is 111013300131179. The reversal of 111013300131112 is 211131003310111.
It can be written as a sum of positive squares in only one way, i.e., 67788645024996 + 43224655106116 = 8233386^2 + 6574546^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a self number, because there is not a number n which added to its sum of digits gives 111013300131112.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6938331258187 + ... + 6938331258202.
Almost surely, 2111013300131112 is an apocalyptic number.
It is an amenable number.
111013300131112 is a deficient number, since it is larger than the sum of its proper divisors (97136637614738).
111013300131112 is a wasteful number, since it uses less digits than its factorization.
111013300131112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13876662516395 (or 13876662516391 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 111013300131112 its reverse (211131003310111), we get a palindrome (322144303441223).
The spelling of 111013300131112 in words is "one hundred eleven trillion, thirteen billion, three hundred million, one hundred thirty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •