Base | Representation |
---|---|
bin | 101111110001011100… |
… | …011001111010000001 |
3 | 11220101212100002010101 |
4 | 233301130121322001 |
5 | 1320023110123312 |
6 | 35321554202401 |
7 | 3464101444615 |
oct | 576134317201 |
9 | 156355302111 |
10 | 51295395457 |
11 | 1a832a05909 |
12 | 9b36883401 |
13 | 4ab6254c07 |
14 | 26a87b3345 |
15 | 1503475a57 |
hex | bf1719e81 |
51295395457 has 4 divisors (see below), whose sum is σ = 51296231236. Its totient is φ = 51294559680.
The previous prime is 51295395449. The next prime is 51295395491. The reversal of 51295395457 is 75459359215.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1264442481 + 50030952976 = 35559^2 + 223676^2 .
It is a cyclic number.
It is not a de Polignac number, because 51295395457 - 23 = 51295395449 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51295395398 and 51295395407.
It is not an unprimeable number, because it can be changed into a prime (51295395427) 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 in 3 ways as a sum of consecutive naturals, for example, 317844 + ... + 451237.
It is an arithmetic number, because the mean of its divisors is an integer number (12824057809).
Almost surely, 251295395457 is an apocalyptic number.
It is an amenable number.
51295395457 is a deficient number, since it is larger than the sum of its proper divisors (835779).
51295395457 is an equidigital number, since it uses as much as digits as its factorization.
51295395457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835778.
The product of its digits is 8505000, while the sum is 55.
The spelling of 51295395457 in words is "fifty-one billion, two hundred ninety-five million, three hundred ninety-five thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •