Base | Representation |
---|---|
bin | 101111001000101100… |
… | …001011100111001001 |
3 | 11211122012202222202012 |
4 | 233020230023213021 |
5 | 1312123041242403 |
6 | 35130051345305 |
7 | 3441130025444 |
oct | 571054134711 |
9 | 154565688665 |
10 | 50611665353 |
11 | 1a511a69307 |
12 | 99858b2235 |
13 | 4a076c11a2 |
14 | 2641a7265b |
15 | 14b3418ed8 |
hex | bc8b0b9c9 |
50611665353 has 2 divisors, whose sum is σ = 50611665354. Its totient is φ = 50611665352.
The previous prime is 50611665337. The next prime is 50611665371. The reversal of 50611665353 is 35356611605.
It is a happy number.
50611665353 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 45763049929 + 4848615424 = 213923^2 + 69632^2 .
It is a cyclic number.
It is not a de Polignac number, because 50611665353 - 24 = 50611665337 is a prime.
It is a super-2 number, since 2×506116653532 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50611665353.
It is not a weakly prime, because it can be changed into another prime (50611665323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25305832676 + 25305832677.
It is an arithmetic number, because the mean of its divisors is an integer number (25305832677).
Almost surely, 250611665353 is an apocalyptic number.
It is an amenable number.
50611665353 is a deficient number, since it is larger than the sum of its proper divisors (1).
50611665353 is an equidigital number, since it uses as much as digits as its factorization.
50611665353 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 243000, while the sum is 41.
The spelling of 50611665353 in words is "fifty billion, six hundred eleven million, six hundred sixty-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •