Base | Representation |
---|---|
bin | 1011111111110… |
… | …0011010100101 |
3 | 10111200100220022 |
4 | 2333330122211 |
5 | 100340120330 |
6 | 4554244525 |
7 | 1150454456 |
oct | 277743245 |
9 | 114610808 |
10 | 50316965 |
11 | 26447976 |
12 | 14a26745 |
13 | a56976a |
14 | 697b12d |
15 | 463dae5 |
hex | 2ffc6a5 |
50316965 has 8 divisors (see below), whose sum is σ = 60564768. Its totient is φ = 40130640.
The previous prime is 50316961. The next prime is 50317037. The reversal of 50316965 is 56961305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50316965 - 22 = 50316961 is a prime.
It is a super-2 number, since 2×503169652 = 5063593933622450, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50316961) 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, 13547 + ... + 16856.
It is an arithmetic number, because the mean of its divisors is an integer number (7570596).
Almost surely, 250316965 is an apocalyptic number.
It is an amenable number.
50316965 is a deficient number, since it is larger than the sum of its proper divisors (10247803).
50316965 is a wasteful number, since it uses less digits than its factorization.
50316965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30739.
The product of its (nonzero) digits is 24300, while the sum is 35.
The square root of 50316965 is about 7093.4452137167. The cubic root of 50316965 is about 369.1799833384.
The spelling of 50316965 in words is "fifty million, three hundred sixteen thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •