Base | Representation |
---|---|
bin | 101111100001001001… |
… | …111101010101000001 |
3 | 11212200211010110122101 |
4 | 233201021331111001 |
5 | 1313443130434403 |
6 | 35234513110401 |
7 | 3454242621064 |
oct | 574111752501 |
9 | 155624113571 |
10 | 51022124353 |
11 | 1a702728222 |
12 | 9a7b258401 |
13 | 4a71755235 |
14 | 268039a8db |
15 | 14d949671d |
hex | be127d541 |
51022124353 has 2 divisors, whose sum is σ = 51022124354. Its totient is φ = 51022124352.
The previous prime is 51022124341. The next prime is 51022124381. The reversal of 51022124353 is 35342122015.
51022124353 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (51022124381) can be obtained adding 51022124353 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50921081649 + 101042704 = 225657^2 + 10052^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51022124353 is a prime.
It is not a weakly prime, because it can be changed into another prime (51022154353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25511062176 + 25511062177.
It is an arithmetic number, because the mean of its divisors is an integer number (25511062177).
Almost surely, 251022124353 is an apocalyptic number.
It is an amenable number.
51022124353 is a deficient number, since it is larger than the sum of its proper divisors (1).
51022124353 is an equidigital number, since it uses as much as digits as its factorization.
51022124353 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 51022124353 its reverse (35342122015), we get a palindrome (86364246368).
The spelling of 51022124353 in words is "fifty-one billion, twenty-two million, one hundred twenty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •