Base | Representation |
---|---|
bin | 10110111100110100… |
… | …11101000100100001 |
3 | 1011210200220112211221 |
4 | 23132122131010201 |
5 | 200213240130421 |
6 | 5354350335041 |
7 | 614223161050 |
oct | 133632350441 |
9 | 34720815757 |
10 | 12321411361 |
11 | 525312a7a6 |
12 | 247a4ba481 |
13 | 121491b26c |
14 | 84c5a6397 |
15 | 4c1aad841 |
hex | 2de69d121 |
12321411361 has 8 divisors (see below), whose sum is σ = 14274512384. Its totient is φ = 10416535200.
The previous prime is 12321411343. The next prime is 12321411367. The reversal of 12321411361 is 16311412321.
12321411361 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 12321411361 - 233 = 3731476769 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12321411367) 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, 12055665 + ... + 12056686.
It is an arithmetic number, because the mean of its divisors is an integer number (1784314048).
Almost surely, 212321411361 is an apocalyptic number.
It is an amenable number.
12321411361 is a deficient number, since it is larger than the sum of its proper divisors (1953101023).
12321411361 is an equidigital number, since it uses as much as digits as its factorization.
12321411361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24112431.
The product of its digits is 864, while the sum is 25.
Adding to 12321411361 its reverse (16311412321), we get a palindrome (28632823682).
The spelling of 12321411361 in words is "twelve billion, three hundred twenty-one million, four hundred eleven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •