Base | Representation |
---|---|
bin | 10111010110101000110100… |
… | …11010001010001110000001 |
3 | 20201211112011211022221010121 |
4 | 23223110122122022032001 |
5 | 23212401242424222424 |
6 | 301120155132300241 |
7 | 13550205604141204 |
oct | 1353243232121601 |
9 | 221745154287117 |
10 | 51355367023489 |
11 | 153aa763942531 |
12 | 5915020611681 |
13 | 2286a37482579 |
14 | c9788220393b |
15 | 5e0d0e6cdee4 |
hex | 2eb51a68a381 |
51355367023489 has 2 divisors, whose sum is σ = 51355367023490. Its totient is φ = 51355367023488.
The previous prime is 51355367023481. The next prime is 51355367023577. The reversal of 51355367023489 is 98432076355315.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29306707663489 + 22048659360000 = 5413567^2 + 4695600^2 .
It is a cyclic number.
It is not a de Polignac number, because 51355367023489 - 23 = 51355367023481 is a prime.
It is a super-2 number, since 2×513553670234892 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51355367023481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25677683511744 + 25677683511745.
It is an arithmetic number, because the mean of its divisors is an integer number (25677683511745).
It is a 1-persistent number, because it is pandigital, but 2⋅51355367023489 = 102710734046978 is not.
Almost surely, 251355367023489 is an apocalyptic number.
It is an amenable number.
51355367023489 is a deficient number, since it is larger than the sum of its proper divisors (1).
51355367023489 is an equidigital number, since it uses as much as digits as its factorization.
51355367023489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648000, while the sum is 61.
The spelling of 51355367023489 in words is "fifty-one trillion, three hundred fifty-five billion, three hundred sixty-seven million, twenty-three thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •