Base | Representation |
---|---|
bin | 111001111000110100… |
… | …1100010011001110001 |
3 | 102212212121101001021121 |
4 | 1303301221202121301 |
5 | 4014043200012121 |
6 | 133035253022241 |
7 | 11660412315025 |
oct | 1636151423161 |
9 | 385777331247 |
10 | 124313282161 |
11 | 487a2674922 |
12 | 20114324981 |
13 | b9519a7333 |
14 | 603412a385 |
15 | 33789b0141 |
hex | 1cf1a62671 |
124313282161 has 2 divisors, whose sum is σ = 124313282162. Its totient is φ = 124313282160.
The previous prime is 124313282147. The next prime is 124313282167. The reversal of 124313282161 is 161282313421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65139800625 + 59173481536 = 255225^2 + 243256^2 .
It is a cyclic number.
It is not a de Polignac number, because 124313282161 - 213 = 124313273969 is a prime.
It is a super-3 number, since 3×1243132821613 (a number of 34 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (124313282167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62156641080 + 62156641081.
It is an arithmetic number, because the mean of its divisors is an integer number (62156641081).
Almost surely, 2124313282161 is an apocalyptic number.
It is an amenable number.
124313282161 is a deficient number, since it is larger than the sum of its proper divisors (1).
124313282161 is an equidigital number, since it uses as much as digits as its factorization.
124313282161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13824, while the sum is 34.
Adding to 124313282161 its reverse (161282313421), we get a palindrome (285595595582).
The spelling of 124313282161 in words is "one hundred twenty-four billion, three hundred thirteen million, two hundred eighty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •