Base | Representation |
---|---|
bin | 10111011110001101011101… |
… | …00011011001101000110101 |
3 | 20202202101202110110120211202 |
4 | 23233012232203121220311 |
5 | 23231132121412333134 |
6 | 301435505003342245 |
7 | 13605046313246654 |
oct | 1357065643315065 |
9 | 222671673416752 |
10 | 51615550511669 |
11 | 154a0039716111 |
12 | 5957533521985 |
13 | 22a54302543c1 |
14 | ca62c529d19b |
15 | 5e798b54cd7e |
hex | 2ef1ae8d9a35 |
51615550511669 has 2 divisors, whose sum is σ = 51615550511670. Its totient is φ = 51615550511668.
The previous prime is 51615550511627. The next prime is 51615550511731. The reversal of 51615550511669 is 96611505551615.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 40403185322500 + 11212365189169 = 6356350^2 + 3348487^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51615550511669 is a prime.
It is a super-2 number, since 2×516155505116692 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51615550517669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25807775255834 + 25807775255835.
It is an arithmetic number, because the mean of its divisors is an integer number (25807775255835).
Almost surely, 251615550511669 is an apocalyptic number.
It is an amenable number.
51615550511669 is a deficient number, since it is larger than the sum of its proper divisors (1).
51615550511669 is an equidigital number, since it uses as much as digits as its factorization.
51615550511669 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6075000, while the sum is 56.
The spelling of 51615550511669 in words is "fifty-one trillion, six hundred fifteen billion, five hundred fifty million, five hundred eleven thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •