Base | Representation |
---|---|
bin | 1100000101100… |
… | …0110100001101 |
3 | 10112101121001210 |
4 | 3001120310031 |
5 | 100434223222 |
6 | 5010325033 |
7 | 1153622052 |
oct | 301306415 |
9 | 115347053 |
10 | 50695437 |
11 | 26686261 |
12 | 14b89779 |
13 | a66cb00 |
14 | 6a39029 |
15 | 46b5d0c |
hex | 3058d0d |
50695437 has 12 divisors (see below), whose sum is σ = 73194144. Its totient is φ = 31196880.
The previous prime is 50695433. The next prime is 50695459. The reversal of 50695437 is 73459605.
It is not a de Polignac number, because 50695437 - 22 = 50695433 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 50695395 and 50695404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50695433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 49489 + ... + 50502.
It is an arithmetic number, because the mean of its divisors is an integer number (6099512).
Almost surely, 250695437 is an apocalyptic number.
It is an amenable number.
50695437 is a deficient number, since it is larger than the sum of its proper divisors (22498707).
50695437 is a wasteful number, since it uses less digits than its factorization.
50695437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100020 (or 100007 counting only the distinct ones).
The product of its (nonzero) digits is 113400, while the sum is 39.
The square root of 50695437 is about 7120.0728226613. The cubic root of 50695437 is about 370.1032996209.
The spelling of 50695437 in words is "fifty million, six hundred ninety-five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •