Base | Representation |
---|---|
bin | 1011111111101… |
… | …1110011000001 |
3 | 10111200020102112 |
4 | 2333323303001 |
5 | 100340030213 |
6 | 4554225105 |
7 | 1150444211 |
oct | 277736301 |
9 | 114606375 |
10 | 50314433 |
11 | 26445a84 |
12 | 14a25195 |
13 | a568570 |
14 | 697a241 |
15 | 463cea8 |
hex | 2ffbcc1 |
50314433 has 8 divisors (see below), whose sum is σ = 55104000. Its totient is φ = 45656208.
The previous prime is 50314403. The next prime is 50314471. The reversal of 50314433 is 33441305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50314433 - 214 = 50298049 is a prime.
It is a super-2 number, since 2×503144332 = 5063084336222978, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50314399 and 50314408.
It is not an unprimeable number, because it can be changed into a prime (50314403) 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, 32033 + ... + 33566.
It is an arithmetic number, because the mean of its divisors is an integer number (6888000).
Almost surely, 250314433 is an apocalyptic number.
It is an amenable number.
50314433 is a deficient number, since it is larger than the sum of its proper divisors (4789567).
50314433 is a wasteful number, since it uses less digits than its factorization.
50314433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65671.
The product of its (nonzero) digits is 2160, while the sum is 23.
The square root of 50314433 is about 7093.2667368428. The cubic root of 50314433 is about 369.1737907325.
Adding to 50314433 its reverse (33441305), we get a palindrome (83755738).
The spelling of 50314433 in words is "fifty million, three hundred fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •