Base | Representation |
---|---|
bin | 10000010100000111011… |
… | …111101100001101101011 |
3 | 10222011210020102021110210 |
4 | 100110013133230031223 |
5 | 121332014211243311 |
6 | 2215010513312203 |
7 | 143666130366666 |
oct | 20240737541553 |
9 | 3864706367423 |
10 | 1121112212331 |
11 | 3a2508686661 |
12 | 161342265663 |
13 | 81949a1b3c7 |
14 | 3c39538a6dd |
15 | 1e2691b63a6 |
hex | 105077ec36b |
1121112212331 has 8 divisors (see below), whose sum is σ = 1535216723344. Its totient is φ = 727207921440.
The previous prime is 1121112212317. The next prime is 1121112212371. The reversal of 1121112212331 is 1332122111211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1121112212331 - 25 = 1121112212299 is a prime.
It is a super-2 number, since 2×11211122123312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1121112212298 and 1121112212307.
It is not an unprimeable number, because it can be changed into a prime (1121112212371) 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, 5050054900 + ... + 5050055121.
It is an arithmetic number, because the mean of its divisors is an integer number (191902090418).
Almost surely, 21121112212331 is an apocalyptic number.
1121112212331 is a deficient number, since it is larger than the sum of its proper divisors (414104511013).
1121112212331 is a wasteful number, since it uses less digits than its factorization.
1121112212331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10100110061.
The product of its digits is 144, while the sum is 21.
Adding to 1121112212331 its reverse (1332122111211), we get a palindrome (2453234323542).
The spelling of 1121112212331 in words is "one trillion, one hundred twenty-one billion, one hundred twelve million, two hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •