Base | Representation |
---|---|
bin | 1011111111010… |
… | …0000000001011 |
3 | 10111121121122002 |
4 | 2333310000023 |
5 | 100333020012 |
6 | 4553421215 |
7 | 1150252142 |
oct | 277640013 |
9 | 114547562 |
10 | 50282507 |
11 | 26423aa0 |
12 | 14a0a80b |
13 | a556b82 |
14 | 696c759 |
15 | 46337c2 |
hex | 2ff400b |
50282507 has 8 divisors (see below), whose sum is σ = 54914112. Its totient is φ = 45661000.
The previous prime is 50282471. The next prime is 50282509. The reversal of 50282507 is 70528205.
50282507 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50282507 - 26 = 50282443 is a prime.
It is a super-3 number, since 3×502825073 (a number of 24 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50282507.
It is not an unprimeable number, because it can be changed into a prime (50282509) 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 7 ways as a sum of consecutive naturals, for example, 11132 + ... + 14982.
It is an arithmetic number, because the mean of its divisors is an integer number (6864264).
Almost surely, 250282507 is an apocalyptic number.
50282507 is a deficient number, since it is larger than the sum of its proper divisors (4631605).
50282507 is a wasteful number, since it uses less digits than its factorization.
50282507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5049.
The product of its (nonzero) digits is 5600, while the sum is 29.
The square root of 50282507 is about 7091.0159356752. The cubic root of 50282507 is about 369.0956903047.
The spelling of 50282507 in words is "fifty million, two hundred eighty-two thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •