Base | Representation |
---|---|
bin | 1100000010111… |
… | …0100110100111 |
3 | 10112001210220000 |
4 | 3000232212213 |
5 | 100413210120 |
6 | 5002512343 |
7 | 1152302010 |
oct | 300564647 |
9 | 115053800 |
10 | 50522535 |
11 | 26578368 |
12 | 14b056b3 |
13 | a60c1bb |
14 | 69d2007 |
15 | 467e990 |
hex | 302e9a7 |
50522535 has 80 divisors (see below), whose sum is σ = 105380352. Its totient is φ = 22680000.
The previous prime is 50522533. The next prime is 50522557. The reversal of 50522535 is 53522505.
50522535 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50522535 - 21 = 50522533 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 50522499 and 50522508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50522533) by changing a digit.
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 79 ways as a sum of consecutive naturals, for example, 201160 + ... + 201410.
Almost surely, 250522535 is an apocalyptic number.
50522535 is an abundant number, since it is smaller than the sum of its proper divisors (54857817).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50522535 is a wasteful number, since it uses less digits than its factorization.
50522535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346 (or 337 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 27.
The square root of 50522535 is about 7107.9205819986. The cubic root of 50522535 is about 369.6820619143.
The spelling of 50522535 in words is "fifty million, five hundred twenty-two thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •