Base | Representation |
---|---|
bin | 1100000111111… |
… | …1111101111101 |
3 | 10112200202001100 |
4 | 3001333331331 |
5 | 101004341210 |
6 | 5014003313 |
7 | 1155160440 |
oct | 301777575 |
9 | 115622040 |
10 | 50855805 |
11 | 267857a0 |
12 | 15046539 |
13 | a6c7ac0 |
14 | 6a7b657 |
15 | 46e85c0 |
hex | 307ff7d |
50855805 has 96 divisors (see below), whose sum is σ = 118460160. Its totient is φ = 19491840.
The previous prime is 50855801. The next prime is 50855807.
50855805 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 50855805 - 22 = 50855801 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50855805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50855801) 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 95 ways as a sum of consecutive naturals, for example, 44481 + ... + 45609.
It is an arithmetic number, because the mean of its divisors is an integer number (1233960).
Almost surely, 250855805 is an apocalyptic number.
50855805 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50855805 is an abundant number, since it is smaller than the sum of its proper divisors (67604355).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50855805 is a wasteful number, since it uses less digits than its factorization.
50855805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1171 (or 1168 counting only the distinct ones).
The product of its (nonzero) digits is 40000, while the sum is 36.
The square root of 50855805 is about 7131.3256130961. The cubic root of 50855805 is about 370.4931456932.
The spelling of 50855805 in words is "fifty million, eight hundred fifty-five thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •