Base | Representation |
---|---|
bin | 10110100110010000… |
… | …10101100000111001 |
3 | 1011022111201011112211 |
4 | 23103020111200321 |
5 | 144321310044231 |
6 | 5323505135121 |
7 | 606434153131 |
oct | 132310254071 |
9 | 34274634484 |
10 | 12132112441 |
11 | 5166296709 |
12 | 242702a4a1 |
13 | 11b463c977 |
14 | 8313abac1 |
15 | 4b0169eb1 |
hex | 2d3215839 |
12132112441 has 4 divisors (see below), whose sum is σ = 12845766132. Its totient is φ = 11418458752.
The previous prime is 12132112423. The next prime is 12132112459. The reversal of 12132112441 is 14421123121.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (12132112423) and next prime (12132112459).
It can be written as a sum of positive squares in 2 ways, for example, as 4037331600 + 8094780841 = 63540^2 + 89971^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12132112441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12132112471) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 356826820 + ... + 356826853.
It is an arithmetic number, because the mean of its divisors is an integer number (3211441533).
Almost surely, 212132112441 is an apocalyptic number.
It is an amenable number.
12132112441 is a deficient number, since it is larger than the sum of its proper divisors (713653691).
12132112441 is an equidigital number, since it uses as much as digits as its factorization.
12132112441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 713653690.
The product of its digits is 384, while the sum is 22.
Adding to 12132112441 its reverse (14421123121), we get a palindrome (26553235562).
The spelling of 12132112441 in words is "twelve billion, one hundred thirty-two million, one hundred twelve thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •