Base | Representation |
---|---|
bin | 10111000000101011101101… |
… | …01010011110011101110100 |
3 | 20122011102000201202001121101 |
4 | 23200111312222132131310 |
5 | 23113021322120414000 |
6 | 255341440113055444 |
7 | 13441541652043135 |
oct | 1340256652363564 |
9 | 218142021661541 |
10 | 50601000560500 |
11 | 15139844718595 |
12 | 5812990857584 |
13 | 2230866755800 |
14 | c6d15c703c8c |
15 | 5cb3ac76ee6a |
hex | 2e0576a9e774 |
50601000560500 has 72 divisors (see below), whose sum is σ = 119667474140760. Its totient is φ = 18683446329600.
The previous prime is 50601000560489. The next prime is 50601000560647. The reversal of 50601000560500 is 506500010605.
It can be written as a sum of positive squares in 12 ways, for example, as 49535865101584 + 1065135458916 = 7038172^2 + 1032054^2 .
It is a super-2 number, since 2×506010005605002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 299329705 + ... + 299498704.
It is an arithmetic number, because the mean of its divisors is an integer number (1662048251955).
Almost surely, 250601000560500 is an apocalyptic number.
50601000560500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50601000560500 is an abundant number, since it is smaller than the sum of its proper divisors (69066473580260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50601000560500 is a wasteful number, since it uses less digits than its factorization.
50601000560500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 598828454 (or 598828429 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 28.
The spelling of 50601000560500 in words is "fifty trillion, six hundred one billion, five hundred sixty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •