Base | Representation |
---|---|
bin | 101111001000100101… |
… | …110110011001100101 |
3 | 11211122002122200000001 |
4 | 233020211312121211 |
5 | 1312122130134410 |
6 | 35125552021301 |
7 | 3441106643515 |
oct | 571045663145 |
9 | 154562580001 |
10 | 50610005605 |
11 | 1a511035315 |
12 | 9985231831 |
13 | 4a0725c8a3 |
14 | 264175d845 |
15 | 14b31dc33a |
hex | bc8976665 |
50610005605 has 16 divisors (see below), whose sum is σ = 61232834160. Its totient is φ = 40155268608.
The previous prime is 50610005581. The next prime is 50610005609. The reversal of 50610005605 is 50650001605.
It can be written as a sum of positive squares in 8 ways, for example, as 24588121636 + 26021883969 = 156806^2 + 161313^2 .
It is a cyclic number.
It is not a de Polignac number, because 50610005605 - 25 = 50610005573 is a prime.
It is a super-2 number, since 2×506100056052 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50610005609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 282259 + ... + 425311.
It is an arithmetic number, because the mean of its divisors is an integer number (3827052135).
Almost surely, 250610005605 is an apocalyptic number.
It is an amenable number.
50610005605 is a deficient number, since it is larger than the sum of its proper divisors (10622828555).
50610005605 is a wasteful number, since it uses less digits than its factorization.
50610005605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143640.
The product of its (nonzero) digits is 4500, while the sum is 28.
It can be divided in two parts, 5061000 and 5605, that added together give a palindrome (5066605).
The spelling of 50610005605 in words is "fifty billion, six hundred ten million, five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •