Base | Representation |
---|---|
bin | 11001010100000101010111… |
… | …111101110100101111110001 |
3 | 112121012011121022211210112010 |
4 | 121110011113331310233301 |
5 | 104043023022203313431 |
6 | 1032440523114153133 |
7 | 32310264654265662 |
oct | 3124052775645761 |
9 | 477164538753463 |
10 | 111331323104241 |
11 | 32523392544199 |
12 | 105a090aa227a9 |
13 | 4a176638c7cb6 |
14 | 1d6c67154b369 |
15 | cd0eb34b7846 |
hex | 654157f74bf1 |
111331323104241 has 16 divisors (see below), whose sum is σ = 161421568637184. Its totient is φ = 67966976265984.
The previous prime is 111331323104237. The next prime is 111331323104269. The reversal of 111331323104241 is 142401323133111.
It is a happy number.
It is not a de Polignac number, because 111331323104241 - 22 = 111331323104237 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111331323104199 and 111331323104208.
It is not an unprimeable number, because it can be changed into a prime (111331323104941) 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, 29499553785 + ... + 29499557558.
It is an arithmetic number, because the mean of its divisors is an integer number (10088848039824).
Almost surely, 2111331323104241 is an apocalyptic number.
It is an amenable number.
111331323104241 is a deficient number, since it is larger than the sum of its proper divisors (50090245532943).
111331323104241 is a wasteful number, since it uses less digits than its factorization.
111331323104241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58999111400.
The product of its (nonzero) digits is 5184, while the sum is 30.
Adding to 111331323104241 its reverse (142401323133111), we get a palindrome (253732646237352).
The spelling of 111331323104241 in words is "one hundred eleven trillion, three hundred thirty-one billion, three hundred twenty-three million, one hundred four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •