Base | Representation |
---|---|
bin | 10110110011010000… |
… | …10000011001111101 |
3 | 1011121002212111221021 |
4 | 23121220100121331 |
5 | 200032213042141 |
6 | 5342402104141 |
7 | 612230000533 |
oct | 133150203175 |
9 | 34532774837 |
10 | 12241143421 |
11 | 5211896261 |
12 | 245764b051 |
13 | 12010c5c40 |
14 | 841a70153 |
15 | 4b9a056d1 |
hex | 2d9a1067d |
12241143421 has 8 divisors (see below), whose sum is σ = 13755934080. Its totient is φ = 10808233392.
The previous prime is 12241143419. The next prime is 12241143449. The reversal of 12241143421 is 12434114221.
12241143421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12241143421 - 21 = 12241143419 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12241143451) 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, 20469841 + ... + 20470438.
It is an arithmetic number, because the mean of its divisors is an integer number (1719491760).
Almost surely, 212241143421 is an apocalyptic number.
It is an amenable number.
12241143421 is a deficient number, since it is larger than the sum of its proper divisors (1514790659).
12241143421 is a wasteful number, since it uses less digits than its factorization.
12241143421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40940315.
The product of its digits is 1536, while the sum is 25.
Adding to 12241143421 its reverse (12434114221), we get a palindrome (24675257642).
The spelling of 12241143421 in words is "twelve billion, two hundred forty-one million, one hundred forty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •