Base | Representation |
---|---|
bin | 111001111001101010… |
… | …0100100100100000101 |
3 | 102212221120011112222102 |
4 | 1303303110210210011 |
5 | 4014122340343141 |
6 | 133042134241445 |
7 | 11661202645364 |
oct | 1636324444405 |
9 | 385846145872 |
10 | 124341340421 |
11 | 48807499471 |
12 | 201217b6285 |
13 | b95774c55c |
14 | 6037b517db |
15 | 337b1a399b |
hex | 1cf3524905 |
124341340421 has 2 divisors, whose sum is σ = 124341340422. Its totient is φ = 124341340420.
The previous prime is 124341340391. The next prime is 124341340423. The reversal of 124341340421 is 124043143421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124316887396 + 24453025 = 352586^2 + 4945^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-124341340421 is a prime.
Together with 124341340423, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (124341340423) 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 as a sum of consecutive naturals, namely, 62170670210 + 62170670211.
It is an arithmetic number, because the mean of its divisors is an integer number (62170670211).
Almost surely, 2124341340421 is an apocalyptic number.
It is an amenable number.
124341340421 is a deficient number, since it is larger than the sum of its proper divisors (1).
124341340421 is an equidigital number, since it uses as much as digits as its factorization.
124341340421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 124341340421 its reverse (124043143421), we get a palindrome (248384483842).
The spelling of 124341340421 in words is "one hundred twenty-four billion, three hundred forty-one million, three hundred forty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •