Base | Representation |
---|---|
bin | 111001000000100001… |
… | …1011101111010110011 |
3 | 102200222221211110222111 |
4 | 1302001003131322303 |
5 | 4001211102113011 |
6 | 132124012350151 |
7 | 11562533663464 |
oct | 1620103357263 |
9 | 380887743874 |
10 | 122424254131 |
11 | 47a13333133 |
12 | 1b887775357 |
13 | b71051587a |
14 | 5cd52bad6b |
15 | 32b7c1d121 |
hex | 1c810ddeb3 |
122424254131 has 2 divisors, whose sum is σ = 122424254132. Its totient is φ = 122424254130.
The previous prime is 122424254107. The next prime is 122424254149. The reversal of 122424254131 is 131452424221.
It is a strong prime.
It is an emirp because it is prime and its reverse (131452424221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122424254131 - 215 = 122424221363 is a prime.
It is a super-2 number, since 2×1224242541312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122424254093 and 122424254102.
It is not a weakly prime, because it can be changed into another prime (122424854131) 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, 61212127065 + 61212127066.
It is an arithmetic number, because the mean of its divisors is an integer number (61212127066).
Almost surely, 2122424254131 is an apocalyptic number.
122424254131 is a deficient number, since it is larger than the sum of its proper divisors (1).
122424254131 is an equidigital number, since it uses as much as digits as its factorization.
122424254131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15360, while the sum is 31.
Adding to 122424254131 its reverse (131452424221), we get a palindrome (253876678352).
The spelling of 122424254131 in words is "one hundred twenty-two billion, four hundred twenty-four million, two hundred fifty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •