Base | Representation |
---|---|
bin | 1100000111001… |
… | …0101011001011 |
3 | 10112120222100200 |
4 | 3001302223023 |
5 | 101001120410 |
6 | 5012503243 |
7 | 1154542623 |
oct | 301625313 |
9 | 115528320 |
10 | 50801355 |
11 | 267488a0 |
12 | 1501ab23 |
13 | a6a9097 |
14 | 6a65883 |
15 | 46d73c0 |
hex | 3072acb |
50801355 has 48 divisors (see below), whose sum is σ = 101728224. Its totient is φ = 23178240.
The previous prime is 50801347. The next prime is 50801363. The reversal of 50801355 is 55310805.
50801355 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (50801347) and next prime (50801363).
It is not a de Polignac number, because 50801355 - 23 = 50801347 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5397 + ... + 11433.
It is an arithmetic number, because the mean of its divisors is an integer number (2119338).
Almost surely, 250801355 is an apocalyptic number.
50801355 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
50801355 is an abundant number, since it is smaller than the sum of its proper divisors (50926869).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50801355 is a wasteful number, since it uses less digits than its factorization.
50801355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6076 (or 6073 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
The square root of 50801355 is about 7127.5069273905. The cubic root of 50801355 is about 370.3608726534.
The spelling of 50801355 in words is "fifty million, eight hundred one thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •