Base | Representation |
---|---|
bin | 1011111100101… |
… | …0101011011011 |
3 | 10111022000110001 |
4 | 2333022223123 |
5 | 100312110433 |
6 | 4550033431 |
7 | 1145645515 |
oct | 277125333 |
9 | 114260401 |
10 | 50113243 |
11 | 26318904 |
12 | 14948877 |
13 | a4c7b0b |
14 | 6926bb5 |
15 | 45ed57d |
hex | 2fcaadb |
50113243 has 8 divisors (see below), whose sum is σ = 51240960. Its totient is φ = 48994920.
The previous prime is 50113237. The next prime is 50113277. The reversal of 50113243 is 34231105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50113243 - 25 = 50113211 is a prime.
It is a super-2 number, since 2×501132432 = 5022674247954098, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50113243.
It is not an unprimeable number, because it can be changed into a prime (50113223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9046 + ... + 13492.
It is an arithmetic number, because the mean of its divisors is an integer number (6405120).
Almost surely, 250113243 is an apocalyptic number.
50113243 is a deficient number, since it is larger than the sum of its proper divisors (1127717).
50113243 is a wasteful number, since it uses less digits than its factorization.
50113243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4697.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 50113243 is about 7079.0707723542. The cubic root of 50113243 is about 368.6810673408.
Adding to 50113243 its reverse (34231105), we get a palindrome (84344348).
The spelling of 50113243 in words is "fifty million, one hundred thirteen thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.003 sec. • engine limits •