Base | Representation |
---|---|
bin | 1100000011001… |
… | …1001110101011 |
3 | 10112002202212210 |
4 | 3000303032223 |
5 | 100414311413 |
6 | 5003140203 |
7 | 1152411156 |
oct | 300631653 |
9 | 115082783 |
10 | 50541483 |
11 | 26590623 |
12 | 14b14663 |
13 | a617a05 |
14 | 69d8c9d |
15 | 46853c3 |
hex | 30333ab |
50541483 has 4 divisors (see below), whose sum is σ = 67388648. Its totient is φ = 33694320.
The previous prime is 50541473. The next prime is 50541509. The reversal of 50541483 is 38414505.
50541483 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 50541483 - 24 = 50541467 is a prime.
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 50541483.
It is not an unprimeable number, because it can be changed into a prime (50541433) 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 3 ways as a sum of consecutive naturals, for example, 8423578 + ... + 8423583.
It is an arithmetic number, because the mean of its divisors is an integer number (16847162).
Almost surely, 250541483 is an apocalyptic number.
50541483 is a deficient number, since it is larger than the sum of its proper divisors (16847165).
50541483 is a wasteful number, since it uses less digits than its factorization.
50541483 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16847164.
The product of its (nonzero) digits is 9600, while the sum is 30.
The square root of 50541483 is about 7109.2533363216. The cubic root of 50541483 is about 369.7282713943.
Adding to 50541483 its reverse (38414505), we get a palindrome (88955988).
The spelling of 50541483 in words is "fifty million, five hundred forty-one thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •