Base | Representation |
---|---|
bin | 1100000010001… |
… | …0011101110001 |
3 | 10111222021200121 |
4 | 3000202131301 |
5 | 100410112232 |
6 | 5001450241 |
7 | 1152004033 |
oct | 300423561 |
9 | 114867617 |
10 | 50472817 |
11 | 26543a7a |
12 | 14aa0981 |
13 | a5c2695 |
14 | 69bbc53 |
15 | 466ed97 |
hex | 3022771 |
50472817 has 4 divisors (see below), whose sum is σ = 50489460. Its totient is φ = 50456176.
The previous prime is 50472811. The next prime is 50472823. The reversal of 50472817 is 71827405.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (50472811) and next prime (50472823).
It can be written as a sum of positive squares in 2 ways, for example, as 8014561 + 42458256 = 2831^2 + 6516^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50472817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50472811) 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 3 ways as a sum of consecutive naturals, for example, 2338 + ... + 10315.
It is an arithmetic number, because the mean of its divisors is an integer number (12622365).
Almost surely, 250472817 is an apocalyptic number.
It is an amenable number.
50472817 is a deficient number, since it is larger than the sum of its proper divisors (16643).
50472817 is a wasteful number, since it uses less digits than its factorization.
50472817 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16642.
The product of its (nonzero) digits is 15680, while the sum is 34.
The square root of 50472817 is about 7104.4223551250. The cubic root of 50472817 is about 369.5607570675.
The spelling of 50472817 in words is "fifty million, four hundred seventy-two thousand, eight hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •