Base | Representation |
---|---|
bin | 1100000001110… |
… | …0111101000111 |
3 | 10111221010201200 |
4 | 3000130331013 |
5 | 100403401442 |
6 | 5001153543 |
7 | 1151551161 |
oct | 300347507 |
9 | 114833650 |
10 | 50450247 |
11 | 26529021 |
12 | 14a8b8b3 |
13 | a5b5323 |
14 | 69b3931 |
15 | 466834c |
hex | 301cf47 |
50450247 has 24 divisors (see below), whose sum is σ = 76422528. Its totient is φ = 32010000.
The previous prime is 50450243. The next prime is 50450249. The reversal of 50450247 is 74205405.
50450247 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 50450247 - 22 = 50450243 is a prime.
It is a super-2 number, since 2×504502472 = 5090454844722018, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50450247.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50450243) 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 23 ways as a sum of consecutive naturals, for example, 51472 + ... + 52442.
It is an arithmetic number, because the mean of its divisors is an integer number (3184272).
Almost surely, 250450247 is an apocalyptic number.
50450247 is a deficient number, since it is larger than the sum of its proper divisors (25972281).
50450247 is a wasteful number, since it uses less digits than its factorization.
50450247 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1251 (or 1248 counting only the distinct ones).
The product of its (nonzero) digits is 5600, while the sum is 27.
The square root of 50450247 is about 7102.8337302798. The cubic root of 50450247 is about 369.5056631881.
The spelling of 50450247 in words is "fifty million, four hundred fifty thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •