Base | Representation |
---|---|
bin | 10000001011110000001… |
… | …111010100110001010001 |
3 | 10221022121101202212220112 |
4 | 100023300033110301101 |
5 | 121210121310031231 |
6 | 2210523442451105 |
7 | 143230445654561 |
oct | 20136017246121 |
9 | 3838541685815 |
10 | 1112132111441 |
11 | 39971a64697a |
12 | 15b656963a95 |
13 | 80b48417640 |
14 | 3bb82874da1 |
15 | 1dde0b1a92b |
hex | 102f03d4c51 |
1112132111441 has 8 divisors (see below), whose sum is σ = 1202234658240. Its totient is φ = 1022680125072.
The previous prime is 1112132111423. The next prime is 1112132111443. The reversal of 1112132111441 is 1441112312111.
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 1112132111441 - 214 = 1112132095057 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1112132111443) 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, 162636551 + ... + 162643388.
It is an arithmetic number, because the mean of its divisors is an integer number (150279332280).
Almost surely, 21112132111441 is an apocalyptic number.
It is an amenable number.
1112132111441 is a deficient number, since it is larger than the sum of its proper divisors (90102546799).
1112132111441 is a wasteful number, since it uses less digits than its factorization.
1112132111441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325280215.
The product of its digits is 192, while the sum is 23.
Adding to 1112132111441 its reverse (1441112312111), we get a palindrome (2553244423552).
The spelling of 1112132111441 in words is "one trillion, one hundred twelve billion, one hundred thirty-two million, one hundred eleven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •