Base | Representation |
---|---|
bin | 101111111010001011… |
… | …110001101011101101 |
3 | 11220210002020221202001 |
4 | 233322023301223231 |
5 | 1320323130000331 |
6 | 35344313132301 |
7 | 3500532023521 |
oct | 577213615355 |
9 | 156702227661 |
10 | 51442031341 |
11 | 1a8a875a598 |
12 | 9b779ba091 |
13 | 4b0a7467cc |
14 | 26c0063d81 |
15 | 151128d561 |
hex | bfa2f1aed |
51442031341 has 2 divisors, whose sum is σ = 51442031342. Its totient is φ = 51442031340.
The previous prime is 51442031309. The next prime is 51442031369. The reversal of 51442031341 is 14313024415.
It is an a-pointer prime, because the next prime (51442031369) can be obtained adding 51442031341 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49938840900 + 1503190441 = 223470^2 + 38771^2 .
It is a cyclic number.
It is not a de Polignac number, because 51442031341 - 25 = 51442031309 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51442031041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25721015670 + 25721015671.
It is an arithmetic number, because the mean of its divisors is an integer number (25721015671).
Almost surely, 251442031341 is an apocalyptic number.
It is an amenable number.
51442031341 is a deficient number, since it is larger than the sum of its proper divisors (1).
51442031341 is an equidigital number, since it uses as much as digits as its factorization.
51442031341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 51442031341 its reverse (14313024415), we get a palindrome (65755055756).
The spelling of 51442031341 in words is "fifty-one billion, four hundred forty-two million, thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •