Base | Representation |
---|---|
bin | 10000010100001101011… |
… | …001000100111111110011 |
3 | 10222012001010120102122110 |
4 | 100110031121010333303 |
5 | 121332220023022011 |
6 | 2215024405540403 |
7 | 144001441314033 |
oct | 20241531047763 |
9 | 3865033512573 |
10 | 1121211142131 |
11 | 3a2559507023 |
12 | 16136b414703 |
13 | 81964378a52 |
14 | 3c3a457d8c3 |
15 | 1e272c08ba6 |
hex | 1050d644ff3 |
1121211142131 has 8 divisors (see below), whose sum is σ = 1496224836544. Its totient is φ = 746835771240.
The previous prime is 1121211142111. The next prime is 1121211142187. The reversal of 1121211142131 is 1312411121211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1121211142131 - 219 = 1121210617843 is a prime.
It is a super-2 number, since 2×11212111421312 (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 = 1121211142098 and 1121211142107.
It is not an unprimeable number, because it can be changed into a prime (1121211142111) 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, 159576781 + ... + 159583806.
It is an arithmetic number, because the mean of its divisors is an integer number (187028104568).
Almost surely, 21121211142131 is an apocalyptic number.
1121211142131 is a deficient number, since it is larger than the sum of its proper divisors (375013694413).
1121211142131 is a wasteful number, since it uses less digits than its factorization.
1121211142131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 319161761.
The product of its digits is 96, while the sum is 21.
Adding to 1121211142131 its reverse (1312411121211), we get a palindrome (2433622263342).
The spelling of 1121211142131 in words is "one trillion, one hundred twenty-one billion, two hundred eleven million, one hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •