Base | Representation |
---|---|
bin | 111010000011101001… |
… | …0110101101000000101 |
3 | 102220210220200212221012 |
4 | 1310013102311220011 |
5 | 4020314131232331 |
6 | 133135304332005 |
7 | 12002412113051 |
oct | 1640722655005 |
9 | 386726625835 |
10 | 124676430341 |
11 | 4896965a491 |
12 | 201b5a74005 |
13 | b9abcb5008 |
14 | 606a45ac61 |
15 | 339a7e482b |
hex | 1d074b5a05 |
124676430341 has 2 divisors, whose sum is σ = 124676430342. Its totient is φ = 124676430340.
The previous prime is 124676430313. The next prime is 124676430343. The reversal of 124676430341 is 143034676421.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85737696100 + 38938734241 = 292810^2 + 197329^2 .
It is a cyclic number.
It is not a de Polignac number, because 124676430341 - 226 = 124609321477 is a prime.
It is a Sophie Germain prime.
Together with 124676430343, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (124676430343) 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, 62338215170 + 62338215171.
It is an arithmetic number, because the mean of its divisors is an integer number (62338215171).
Almost surely, 2124676430341 is an apocalyptic number.
It is an amenable number.
124676430341 is a deficient number, since it is larger than the sum of its proper divisors (1).
124676430341 is an equidigital number, since it uses as much as digits as its factorization.
124676430341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 290304, while the sum is 41.
The spelling of 124676430341 in words is "one hundred twenty-four billion, six hundred seventy-six million, four hundred thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •