Base | Representation |
---|---|
bin | 1011111101111… |
… | …1111110100001 |
3 | 10111110110010002 |
4 | 2333133332201 |
5 | 100322403411 |
6 | 4551545345 |
7 | 1146461042 |
oct | 277377641 |
9 | 114413102 |
10 | 50200481 |
11 | 26378401 |
12 | 1498b255 |
13 | a528736 |
14 | 694a8c9 |
15 | 461933b |
hex | 2fdffa1 |
50200481 has 4 divisors (see below), whose sum is σ = 50242752. Its totient is φ = 50158212.
The previous prime is 50200477. The next prime is 50200519. The reversal of 50200481 is 18400205.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50200481 - 22 = 50200477 is a prime.
It is a super-3 number, since 3×502004813 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50200411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19301 + ... + 21746.
It is an arithmetic number, because the mean of its divisors is an integer number (12560688).
Almost surely, 250200481 is an apocalyptic number.
It is an amenable number.
50200481 is a deficient number, since it is larger than the sum of its proper divisors (42271).
50200481 is a wasteful number, since it uses less digits than its factorization.
50200481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42270.
The product of its (nonzero) digits is 320, while the sum is 20.
The square root of 50200481 is about 7085.2297775019. The cubic root of 50200481 is about 368.8948787790.
Adding to 50200481 its reverse (18400205), we get a palindrome (68600686).
The spelling of 50200481 in words is "fifty million, two hundred thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •