Base | Representation |
---|---|
bin | 10000010100001000000… |
… | …001101110001010101111 |
3 | 10222011210212012111122111 |
4 | 100110020001232022233 |
5 | 121332024002230411 |
6 | 2215011432424451 |
7 | 143666266253311 |
oct | 20241001561257 |
9 | 3864725174574 |
10 | 1121121133231 |
11 | 3a251271a000 |
12 | 161345248127 |
13 | 8194b822a48 |
14 | 3c39662d7b1 |
15 | 1e269d79721 |
hex | 1050806e2af |
1121121133231 has 32 divisors (see below), whose sum is σ = 1307860862976. Its totient is φ = 958904575200.
The previous prime is 1121121133213. The next prime is 1121121133243. The reversal of 1121121133231 is 1323311211211.
It is not a de Polignac number, because 1121121133231 - 231 = 1118973649583 is a prime.
It is a super-2 number, since 2×11211211332312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121121133271) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1567210 + ... + 2167576.
It is an arithmetic number, because the mean of its divisors is an integer number (40870651968).
Almost surely, 21121121133231 is an apocalyptic number.
1121121133231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1121121133231 is a deficient number, since it is larger than the sum of its proper divisors (186739729745).
1121121133231 is an equidigital number, since it uses as much as digits as its factorization.
1121121133231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 600484 (or 600462 counting only the distinct ones).
The product of its digits is 216, while the sum is 22.
Adding to 1121121133231 its reverse (1323311211211), we get a palindrome (2444432344442).
The spelling of 1121121133231 in words is "one trillion, one hundred twenty-one billion, one hundred twenty-one million, one hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •