Base | Representation |
---|---|
bin | 10111000000101011110011… |
… | …00111000110000001100101 |
3 | 20122011102011011210010112120 |
4 | 23200111321213012001211 |
5 | 23113021422300134410 |
6 | 255341445040540153 |
7 | 13441543122240021 |
oct | 1340257147060145 |
9 | 218142134703476 |
10 | 50601050005605 |
11 | 1513986a61a410 |
12 | 58129a5321659 |
13 | 2230873a78478 |
14 | c6d1650d5381 |
15 | 5cb3b1c8a570 |
hex | 2e05799c6065 |
50601050005605 has 64 divisors (see below), whose sum is σ = 89249798350080. Its totient is φ = 24276365568000.
The previous prime is 50601050005603. The next prime is 50601050005631. The reversal of 50601050005605 is 50650005010605.
It is not a de Polignac number, because 50601050005605 - 21 = 50601050005603 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50601050005601) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 26904249 + ... + 28723521.
It is an arithmetic number, because the mean of its divisors is an integer number (1394528099220).
Almost surely, 250601050005605 is an apocalyptic number.
50601050005605 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50601050005605 is a deficient number, since it is larger than the sum of its proper divisors (38648748344475).
50601050005605 is a wasteful number, since it uses less digits than its factorization.
50601050005605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1821062.
The product of its (nonzero) digits is 22500, while the sum is 33.
It can be divided in two parts, 5060105000 and 5605, that added together give a palindrome (5060110605).
The spelling of 50601050005605 in words is "fifty trillion, six hundred one billion, fifty million, five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •