Base | Representation |
---|---|
bin | 1100000011000… |
… | …1011010110000 |
3 | 10112002101201000 |
4 | 3000301122300 |
5 | 100414042224 |
6 | 5003042000 |
7 | 1152350430 |
oct | 300613260 |
9 | 115071630 |
10 | 50534064 |
11 | 26585a99 |
12 | 14b10300 |
13 | a614519 |
14 | 69d62c0 |
15 | 46830c9 |
hex | 30316b0 |
50534064 has 160 divisors (see below), whose sum is σ = 175703040. Its totient is φ = 13575168.
The previous prime is 50534051. The next prime is 50534087. The reversal of 50534064 is 46043505.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 50917 + ... + 51899.
It is an arithmetic number, because the mean of its divisors is an integer number (1098144).
Almost surely, 250534064 is an apocalyptic number.
50534064 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50534064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87851520).
50534064 is an abundant number, since it is smaller than the sum of its proper divisors (125168976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50534064 is a wasteful number, since it uses less digits than its factorization.
50534064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1024 (or 1012 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The square root of 50534064 is about 7108.7315324184. The cubic root of 50534064 is about 369.7101796664.
Adding to 50534064 its reverse (46043505), we get a palindrome (96577569).
The spelling of 50534064 in words is "fifty million, five hundred thirty-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •