Base | Representation |
---|---|
bin | 101111001000000101… |
… | …011001111110010101 |
3 | 11211121111122120021120 |
4 | 233020011121332111 |
5 | 1312112441004230 |
6 | 35125045434153 |
7 | 3440644441500 |
oct | 571005317625 |
9 | 154544576246 |
10 | 50601500565 |
11 | 1a507256360 |
12 | 998240b959 |
13 | 4a05572615 |
14 | 2640588137 |
15 | 14b25ac310 |
hex | bc8159f95 |
50601500565 has 48 divisors (see below), whose sum is σ = 102742655040. Its totient is φ = 21029191680.
The previous prime is 50601500491. The next prime is 50601500567. The reversal of 50601500565 is 56500510605.
It is not a de Polignac number, because 50601500565 - 27 = 50601500437 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 (50601500567) 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 47 ways as a sum of consecutive naturals, for example, 3121260 + ... + 3137429.
It is an arithmetic number, because the mean of its divisors is an integer number (2140471980).
Almost surely, 250601500565 is an apocalyptic number.
50601500565 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50601500565 is an abundant number, since it is smaller than the sum of its proper divisors (52141154475).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50601500565 is a wasteful number, since it uses less digits than its factorization.
50601500565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6258722 (or 6258715 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 33.
The spelling of 50601500565 in words is "fifty billion, six hundred one million, five hundred thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •