Base | Representation |
---|---|
bin | 10111001111101011111001… |
… | …11000100110010100111001 |
3 | 20200222200121211202202120101 |
4 | 23213311330320212110321 |
5 | 23144443043224022104 |
6 | 300414332452355401 |
7 | 13524021355353625 |
oct | 1347657470462471 |
9 | 220880554682511 |
10 | 51116501001529 |
11 | 15318428235827 |
12 | 5896878915b61 |
13 | 226a35acca382 |
14 | c8a0a23ba185 |
15 | 5d99ce0bb5a4 |
hex | 2e7d7ce26539 |
51116501001529 has 2 divisors, whose sum is σ = 51116501001530. Its totient is φ = 51116501001528.
The previous prime is 51116501001521. The next prime is 51116501001569. The reversal of 51116501001529 is 92510010561115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39870384490000 + 11246116511529 = 6314300^2 + 3353523^2 .
It is a cyclic number.
It is not a de Polignac number, because 51116501001529 - 23 = 51116501001521 is a prime.
It is a super-2 number, since 2×511165010015292 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51116501001521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25558250500764 + 25558250500765.
It is an arithmetic number, because the mean of its divisors is an integer number (25558250500765).
Almost surely, 251116501001529 is an apocalyptic number.
It is an amenable number.
51116501001529 is a deficient number, since it is larger than the sum of its proper divisors (1).
51116501001529 is an equidigital number, since it uses as much as digits as its factorization.
51116501001529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 37.
The spelling of 51116501001529 in words is "fifty-one trillion, one hundred sixteen billion, five hundred one million, one thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •