Base | Representation |
---|---|
bin | 10000010100000001011… |
… | …101101101110001010001 |
3 | 10222011112012000201221120 |
4 | 100110001131231301101 |
5 | 121331312310443441 |
6 | 2214552500512453 |
7 | 143663461355022 |
oct | 20240135556121 |
9 | 3864465021846 |
10 | 1121011031121 |
11 | 3a2466558723 |
12 | 1613143ab729 |
13 | 81931a83077 |
14 | 3c385b6cc49 |
15 | 1e26037b966 |
hex | 1050176dc51 |
1121011031121 has 8 divisors (see below), whose sum is σ = 1494746337504. Its totient is φ = 747308206080.
The previous prime is 1121011031087. The next prime is 1121011031123. The reversal of 1121011031121 is 1211301101211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1121011031121 - 227 = 1120876813393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1121011031121.
It is not an unprimeable number, because it can be changed into a prime (1121011031123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8039691 + ... + 8177936.
It is an arithmetic number, because the mean of its divisors is an integer number (186843292188).
Almost surely, 21121011031121 is an apocalyptic number.
It is an amenable number.
1121011031121 is a deficient number, since it is larger than the sum of its proper divisors (373735306383).
1121011031121 is a wasteful number, since it uses less digits than its factorization.
1121011031121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16240671.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 1121011031121 its reverse (1211301101211), we get a palindrome (2332312132332).
The spelling of 1121011031121 in words is "one trillion, one hundred twenty-one billion, eleven million, thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •