Base | Representation |
---|---|
bin | 1100000011011… |
… | …0101010001111 |
3 | 10112010111011020 |
4 | 3000312222033 |
5 | 100420234120 |
6 | 5003325223 |
7 | 1152500142 |
oct | 300665217 |
9 | 115114136 |
10 | 50555535 |
11 | 265a0138 |
12 | 14b20813 |
13 | a621224 |
14 | 6a00059 |
15 | 4689640 |
hex | 3036a8f |
50555535 has 16 divisors (see below), whose sum is σ = 85647456. Its totient is φ = 25376768.
The previous prime is 50555521. The next prime is 50555537. The reversal of 50555535 is 53555505.
50555535 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 50555535 - 28 = 50555279 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50555496 and 50555505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50555537) 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 15 ways as a sum of consecutive naturals, for example, 98874 + ... + 99383.
It is an arithmetic number, because the mean of its divisors is an integer number (5352966).
Almost surely, 250555535 is an apocalyptic number.
50555535 is a deficient number, since it is larger than the sum of its proper divisors (35091921).
50555535 is a wasteful number, since it uses less digits than its factorization.
50555535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198282.
The product of its (nonzero) digits is 46875, while the sum is 33.
The square root of 50555535 is about 7110.2415570781. The cubic root of 50555535 is about 369.7625332846.
The spelling of 50555535 in words is "fifty million, five hundred fifty-five thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •