Base | Representation |
---|---|
bin | 101111001000111100… |
… | …111100111010100101 |
3 | 11211122112001100021100 |
4 | 233020330330322211 |
5 | 1312130202432410 |
6 | 35130325510313 |
7 | 3441212265504 |
oct | 571074747245 |
9 | 154575040240 |
10 | 50616061605 |
11 | 1a5144a127a |
12 | 9987272399 |
13 | 4a085a0215 |
14 | 264249883b |
15 | 14b39d68c0 |
hex | bc8f3cea5 |
50616061605 has 24 divisors (see below), whose sum is σ = 90105712632. Its totient is φ = 26265631104.
The previous prime is 50616061589. The next prime is 50616061609.
50616061605 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 13628694564 + 36987367041 = 116742^2 + 192321^2 .
It is not a de Polignac number, because 50616061605 - 24 = 50616061589 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50616061605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50616061609) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15198354 + ... + 15201683.
It is an arithmetic number, because the mean of its divisors is an integer number (3754404693).
Almost surely, 250616061605 is an apocalyptic number.
It is an amenable number.
50616061605 is a deficient number, since it is larger than the sum of its proper divisors (39489651027).
50616061605 is a wasteful number, since it uses less digits than its factorization.
50616061605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30400085 (or 30400082 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
It can be divided in two parts, 506160 and 61605, that added together give a palindrome (567765).
The spelling of 50616061605 in words is "fifty billion, six hundred sixteen million, sixty-one thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •