Base | Representation |
---|---|
bin | 101111100110001001… |
… | …110000100111010101 |
3 | 11212220122212200021111 |
4 | 233212021300213111 |
5 | 1314131111131412 |
6 | 35251110015021 |
7 | 3456311323066 |
oct | 574611604725 |
9 | 155818780244 |
10 | 51105958357 |
11 | 1a745a87a23 |
12 | 9aa3347471 |
13 | 4a85c2875c |
14 | 268b58056d |
15 | 14e1a062a7 |
hex | be62709d5 |
51105958357 has 2 divisors, whose sum is σ = 51105958358. Its totient is φ = 51105958356.
The previous prime is 51105958303. The next prime is 51105958361. The reversal of 51105958357 is 75385950115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35029239921 + 16076718436 = 187161^2 + 126794^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51105958357 is a prime.
It is a super-2 number, since 2×511059583572 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51105958357.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51105956357) 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, 25552979178 + 25552979179.
It is an arithmetic number, because the mean of its divisors is an integer number (25552979179).
Almost surely, 251105958357 is an apocalyptic number.
It is an amenable number.
51105958357 is a deficient number, since it is larger than the sum of its proper divisors (1).
51105958357 is an equidigital number, since it uses as much as digits as its factorization.
51105958357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 945000, while the sum is 49.
The spelling of 51105958357 in words is "fifty-one billion, one hundred five million, nine hundred fifty-eight thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •