Base | Representation |
---|---|
bin | 1100000100010… |
… | …0101111010001 |
3 | 10112020102021000 |
4 | 3001010233101 |
5 | 100424110301 |
6 | 5004452213 |
7 | 1153130232 |
oct | 301045721 |
9 | 115212230 |
10 | 50613201 |
11 | 2662a4a1 |
12 | 14b4a069 |
13 | a641552 |
14 | 6a17089 |
15 | 469b786 |
hex | 3044bd1 |
50613201 has 16 divisors (see below), whose sum is σ = 75096000. Its totient is φ = 33691104.
The previous prime is 50613181. The next prime is 50613217. The reversal of 50613201 is 10231605.
50613201 is a `hidden beast` number, since 50 + 613 + 2 + 0 + 1 = 666.
It is not a de Polignac number, because 50613201 - 214 = 50596817 is a prime.
It is a super-2 number, since 2×506132012 = 5123392230932802, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (50613001) 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 15 ways as a sum of consecutive naturals, for example, 27430 + ... + 29216.
It is an arithmetic number, because the mean of its divisors is an integer number (4693500).
Almost surely, 250613201 is an apocalyptic number.
It is an amenable number.
50613201 is a deficient number, since it is larger than the sum of its proper divisors (24482799).
50613201 is a wasteful number, since it uses less digits than its factorization.
50613201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2845 (or 2839 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 50613201 is about 7114.2955378590. The cubic root of 50613201 is about 369.9030693252.
Adding to 50613201 its reverse (10231605), we get a palindrome (60844806).
It can be divided in two parts, 5061 and 3201, that multiplied together give a palindrome (16200261).
The spelling of 50613201 in words is "fifty million, six hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.155 sec. • engine limits •