Base | Representation |
---|---|
bin | 10011010110011010001110… |
… | …01011111110011011110001 |
3 | 12120122212200200121201022112 |
4 | 21223031013023332123301 |
5 | 21034130314420314441 |
6 | 230255505354015105 |
7 | 11651145143335424 |
oct | 1153150713763361 |
9 | 176585620551275 |
10 | 42551435323121 |
11 | 12615a64a2095a |
12 | 4932905717495 |
13 | 1a987771b4c2a |
14 | a717013879bb |
15 | 4dbcd91e34eb |
hex | 26b3472fe6f1 |
42551435323121 has 2 divisors, whose sum is σ = 42551435323122. Its totient is φ = 42551435323120.
The previous prime is 42551435323069. The next prime is 42551435323123. The reversal of 42551435323121 is 12132353415524.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35360993073121 + 7190442250000 = 5946511^2 + 2681500^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42551435323121 is a prime.
Together with 42551435323123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (42551435323123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21275717661560 + 21275717661561.
It is an arithmetic number, because the mean of its divisors is an integer number (21275717661561).
Almost surely, 242551435323121 is an apocalyptic number.
It is an amenable number.
42551435323121 is a deficient number, since it is larger than the sum of its proper divisors (1).
42551435323121 is an equidigital number, since it uses as much as digits as its factorization.
42551435323121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432000, while the sum is 41.
Adding to 42551435323121 its reverse (12132353415524), we get a palindrome (54683788738645).
The spelling of 42551435323121 in words is "forty-two trillion, five hundred fifty-one billion, four hundred thirty-five million, three hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •