Base | Representation |
---|---|
bin | 1011111011000… |
… | …0010010001011 |
3 | 10111002112010220 |
4 | 2332300102023 |
5 | 100300131011 |
6 | 4543441123 |
7 | 1145015361 |
oct | 276602213 |
9 | 114075126 |
10 | 50005131 |
11 | 26254660 |
12 | 148b61a3 |
13 | a48a847 |
14 | 68d9631 |
15 | 45cb506 |
hex | 2fb048b |
50005131 has 32 divisors (see below), whose sum is σ = 77172480. Its totient is φ = 28483200.
The previous prime is 50005121. The next prime is 50005181. The reversal of 50005131 is 13150005.
50005131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50005131 - 225 = 16450699 is a prime.
It is a super-2 number, since 2×500051312 = 5001026252654322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50005131.
It is not an unprimeable number, because it can be changed into a prime (50005121) 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 31 ways as a sum of consecutive naturals, for example, 108241 + ... + 108701.
It is an arithmetic number, because the mean of its divisors is an integer number (2411640).
Almost surely, 250005131 is an apocalyptic number.
50005131 is a deficient number, since it is larger than the sum of its proper divisors (27167349).
50005131 is a wasteful number, since it uses less digits than its factorization.
50005131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667.
The product of its (nonzero) digits is 75, while the sum is 15.
The square root of 50005131 is about 7071.4306190473. The cubic root of 50005131 is about 368.4157512767.
Adding to 50005131 its reverse (13150005), we get a palindrome (63155136).
The spelling of 50005131 in words is "fifty million, five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •