Base | Representation |
---|---|
bin | 1100011101001… |
… | …0010011110010 |
3 | 10122022011001221 |
4 | 3013102103302 |
5 | 101333213100 |
6 | 5103415254 |
7 | 1203022006 |
oct | 307222362 |
9 | 118264057 |
10 | 52241650 |
11 | 27541a1a |
12 | 155b452a |
13 | aa91826 |
14 | 6d1c706 |
15 | 48be01a |
hex | 31d24f2 |
52241650 has 12 divisors (see below), whose sum is σ = 97169562. Its totient is φ = 20896640.
The previous prime is 52241569. The next prime is 52241653. The reversal of 52241650 is 5614225.
52241650 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 32501401 + 19740249 = 5701^2 + 4443^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52241653) 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 5 ways as a sum of consecutive naturals, for example, 522367 + ... + 522466.
Almost surely, 252241650 is an apocalyptic number.
52241650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
52241650 is a deficient number, since it is larger than the sum of its proper divisors (44927912).
52241650 is a wasteful number, since it uses less digits than its factorization.
52241650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1044845 (or 1044840 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 52241650 is about 7227.8385427457. The cubic root of 52241650 is about 373.8284026973.
Adding to 52241650 its reverse (5614225), we get a palindrome (57855875).
The spelling of 52241650 in words is "fifty-two million, two hundred forty-one thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •