Base | Representation |
---|---|
bin | 10111001110110100000011… |
… | …10010010111000001001001 |
3 | 20200212211020022100220110221 |
4 | 23213122001302113001021 |
5 | 23144000142212342334 |
6 | 300352453403110041 |
7 | 13521610360215346 |
oct | 1347320162270111 |
9 | 220784208326427 |
10 | 51086518480969 |
11 | 15306741950314 |
12 | 5890aab812321 |
13 | 226759044534a |
14 | c8885a4017cd |
15 | 5d8d26c968b4 |
hex | 2e7681c97049 |
51086518480969 has 2 divisors, whose sum is σ = 51086518480970. Its totient is φ = 51086518480968.
The previous prime is 51086518480873. The next prime is 51086518480993. The reversal of 51086518480969 is 96908481568015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 44970972481600 + 6115545999369 = 6706040^2 + 2472963^2 .
It is a cyclic number.
It is not a de Polignac number, because 51086518480969 - 217 = 51086518349897 is a prime.
It is a super-2 number, since 2×510865184809692 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51086518480898 and 51086518480907.
It is not a weakly prime, because it can be changed into another prime (51086518480999) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25543259240484 + 25543259240485.
It is an arithmetic number, because the mean of its divisors is an integer number (25543259240485).
Almost surely, 251086518480969 is an apocalyptic number.
It is an amenable number.
51086518480969 is a deficient number, since it is larger than the sum of its proper divisors (1).
51086518480969 is an equidigital number, since it uses as much as digits as its factorization.
51086518480969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 149299200, while the sum is 70.
The spelling of 51086518480969 in words is "fifty-one trillion, eighty-six billion, five hundred eighteen million, four hundred eighty thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •