Base | Representation |
---|---|
bin | 10000001010110100100… |
… | …100111001010101111111 |
3 | 10221020000122020221001110 |
4 | 100022310210321111333 |
5 | 121201044032231221 |
6 | 2210240244213103 |
7 | 143163602541153 |
oct | 20126444712577 |
9 | 3836018227043 |
10 | 1111131133311 |
11 | 399256615221 |
12 | 15b41769a193 |
13 | 80a18c271a4 |
14 | 3bac9951063 |
15 | 1dd82ce4776 |
hex | 102b493957f |
1111131133311 has 8 divisors (see below), whose sum is σ = 1481816908800. Its totient is φ = 740599723352.
The previous prime is 1111131133213. The next prime is 1111131133313. The reversal of 1111131133311 is 1133311311111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1111131133311 - 215 = 1111131100543 is a prime.
It is a super-2 number, since 2×11111311333112 (a number of 25 digits) contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111131133313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38574585 + ... + 38603378.
It is an arithmetic number, because the mean of its divisors is an integer number (185227113600).
Almost surely, 21111131133311 is an apocalyptic number.
1111131133311 is a deficient number, since it is larger than the sum of its proper divisors (370685775489).
1111131133311 is an equidigital number, since it uses as much as digits as its factorization.
1111131133311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77182765.
The product of its digits is 81, while the sum is 21.
Adding to 1111131133311 its reverse (1133311311111), we get a palindrome (2244442444422).
The spelling of 1111131133311 in words is "one trillion, one hundred eleven billion, one hundred thirty-one million, one hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •