Base | Representation |
---|---|
bin | 10111000000111101100101… |
… | …10110011010001000111101 |
3 | 20122012022210202021010021102 |
4 | 23200132302312122020331 |
5 | 23113201002131143221 |
6 | 255350104435542445 |
7 | 13442331566104556 |
oct | 1340366266321075 |
9 | 218168722233242 |
10 | 50610600256061 |
11 | 1514292047998a |
12 | 581480b75aa25 |
13 | 2231736525c41 |
14 | c6d7cd62332d |
15 | 5cb77040930b |
hex | 2e07b2d9a23d |
50610600256061 has 2 divisors, whose sum is σ = 50610600256062. Its totient is φ = 50610600256060.
The previous prime is 50610600256057. The next prime is 50610600256079. The reversal of 50610600256061 is 16065200601605.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 37639574712100 + 12971025543961 = 6135110^2 + 3601531^2 .
It is a cyclic number.
It is not a de Polignac number, because 50610600256061 - 22 = 50610600256057 is a prime.
It is a super-2 number, since 2×506106002560612 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50610605256061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25305300128030 + 25305300128031.
It is an arithmetic number, because the mean of its divisors is an integer number (25305300128031).
Almost surely, 250610600256061 is an apocalyptic number.
It is an amenable number.
50610600256061 is a deficient number, since it is larger than the sum of its proper divisors (1).
50610600256061 is an equidigital number, since it uses as much as digits as its factorization.
50610600256061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64800, while the sum is 38.
Adding to 50610600256061 its reverse (16065200601605), we get a palindrome (66675800857666).
The spelling of 50610600256061 in words is "fifty trillion, six hundred ten billion, six hundred million, two hundred fifty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •