Base | Representation |
---|---|
bin | 1100000101001… |
… | …0110110111010 |
3 | 10112100100120222 |
4 | 3001102312322 |
5 | 100432433114 |
6 | 5010020042 |
7 | 1153460651 |
oct | 301226672 |
9 | 115310528 |
10 | 50671034 |
11 | 26669997 |
12 | 14b77622 |
13 | a66197b |
14 | 6a30198 |
15 | 46ad98e |
hex | 3052dba |
50671034 has 8 divisors (see below), whose sum is σ = 76059648. Its totient is φ = 25317820.
The previous prime is 50671031. The next prime is 50671037. The reversal of 50671034 is 43017605.
50671034 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (50671031) and next prime (50671037).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 50670994 and 50671012.
It is not an unprimeable number, because it can be changed into a prime (50671031) 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, 4922 + ... + 11205.
It is an arithmetic number, because the mean of its divisors is an integer number (9507456).
Almost surely, 250671034 is an apocalyptic number.
50671034 is a deficient number, since it is larger than the sum of its proper divisors (25388614).
50671034 is a wasteful number, since it uses less digits than its factorization.
50671034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17700.
The product of its (nonzero) digits is 2520, while the sum is 26.
The square root of 50671034 is about 7118.3589400929. The cubic root of 50671034 is about 370.0439051868.
Adding to 50671034 its reverse (43017605), we get a palindrome (93688639).
The spelling of 50671034 in words is "fifty million, six hundred seventy-one thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •