Base | Representation |
---|---|
bin | 10111010101000111100100… |
… | …10111001111111011111001 |
3 | 20201122112102010020222210011 |
4 | 23222203302113033323321 |
5 | 23211022330311024111 |
6 | 301040202211421521 |
7 | 13543350010101415 |
oct | 1352436227177371 |
9 | 221575363228704 |
10 | 51303155564281 |
11 | 1538a600933445 |
12 | 5906a8abb48a1 |
13 | 2281b364cb3ca |
14 | c9512bcd1d45 |
15 | 5de7a5b07021 |
hex | 2ea8f25cfef9 |
51303155564281 has 2 divisors, whose sum is σ = 51303155564282. Its totient is φ = 51303155564280.
The previous prime is 51303155564209. The next prime is 51303155564291. The reversal of 51303155564281 is 18246555130315.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38643193813225 + 12659961751056 = 6216365^2 + 3558084^2 .
It is a cyclic number.
It is not a de Polignac number, because 51303155564281 - 223 = 51303147175673 is a prime.
It is a super-2 number, since 2×513031555642812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51303155564291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25651577782140 + 25651577782141.
It is an arithmetic number, because the mean of its divisors is an integer number (25651577782141).
Almost surely, 251303155564281 is an apocalyptic number.
It is an amenable number.
51303155564281 is a deficient number, since it is larger than the sum of its proper divisors (1).
51303155564281 is an equidigital number, since it uses as much as digits as its factorization.
51303155564281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160000, while the sum is 49.
The spelling of 51303155564281 in words is "fifty-one trillion, three hundred three billion, one hundred fifty-five million, five hundred sixty-four thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •