Base | Representation |
---|---|
bin | 10000011111011110101… |
… | …110100000001001111011 |
3 | 11000100021112121011121021 |
4 | 100133132232200021323 |
5 | 122032011130144011 |
6 | 2224345321323311 |
7 | 144610361445556 |
oct | 20373656401173 |
9 | 4010245534537 |
10 | 1133313131131 |
11 | 3a76a9798525 |
12 | 163788336537 |
13 | 82b4269c49c |
14 | 3cbd194969d |
15 | 1e7303c3471 |
hex | 107deba027b |
1133313131131 has 8 divisors (see below), whose sum is σ = 1169888316800. Its totient is φ = 1096738989120.
The previous prime is 1133313131113. The next prime is 1133313131141. The reversal of 1133313131131 is 1311313133311.
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 1133313131131 - 29 = 1133313130619 is a prime.
It is a super-2 number, since 2×11333131311312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1133313131096 and 1133313131105.
It is not an unprimeable number, because it can be changed into a prime (1133313131141) 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, 2365855 + ... + 2804263.
It is an arithmetic number, because the mean of its divisors is an integer number (146236039600).
Almost surely, 21133313131131 is an apocalyptic number.
1133313131131 is a deficient number, since it is larger than the sum of its proper divisors (36575185669).
1133313131131 is an equidigital number, since it uses as much as digits as its factorization.
1133313131131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 521829.
The product of its digits is 729, while the sum is 25.
Adding to 1133313131131 its reverse (1311313133311), we get a palindrome (2444626264442).
The spelling of 1133313131131 in words is "one trillion, one hundred thirty-three billion, three hundred thirteen million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •