Base | Representation |
---|---|
bin | 1011010011000001100001… |
… | …1011111110010000111101 |
3 | 1121222110221120210000221011 |
4 | 2310300120123332100331 |
5 | 3112003120040444031 |
6 | 42230200550035221 |
7 | 2421264146605015 |
oct | 264603033762075 |
9 | 47873846700834 |
10 | 12421455406141 |
11 | 3a59a00828411 |
12 | 1487440348b11 |
13 | 6c14520b3302 |
14 | 30d2b747cc45 |
15 | 16819d2216b1 |
hex | b4c186fe43d |
12421455406141 has 2 divisors, whose sum is σ = 12421455406142. Its totient is φ = 12421455406140.
The previous prime is 12421455406117. The next prime is 12421455406147. The reversal of 12421455406141 is 14160455412421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10182927744900 + 2238527661241 = 3191070^2 + 1496171^2 .
It is a cyclic number.
It is not a de Polignac number, because 12421455406141 - 27 = 12421455406013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12421455406094 and 12421455406103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12421455406147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6210727703070 + 6210727703071.
It is an arithmetic number, because the mean of its divisors is an integer number (6210727703071).
Almost surely, 212421455406141 is an apocalyptic number.
It is an amenable number.
12421455406141 is a deficient number, since it is larger than the sum of its proper divisors (1).
12421455406141 is an equidigital number, since it uses as much as digits as its factorization.
12421455406141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 153600, while the sum is 40.
The spelling of 12421455406141 in words is "twelve trillion, four hundred twenty-one billion, four hundred fifty-five million, four hundred six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •