Base | Representation |
---|---|
bin | 1011111101001… |
… | …1100011000100 |
3 | 10111100212021120 |
4 | 2333103203010 |
5 | 100314241242 |
6 | 4550513540 |
7 | 1146156444 |
oct | 277234304 |
9 | 114325246 |
10 | 50149572 |
11 | 26343130 |
12 | 149658b0 |
13 | a50b505 |
14 | 6936124 |
15 | 46091ec |
hex | 2fd38c4 |
50149572 has 48 divisors (see below), whose sum is σ = 129475584. Its totient is φ = 14980000.
The previous prime is 50149559. The next prime is 50149573. The reversal of 50149572 is 27594105.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (50149573) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6697 + ... + 12047.
It is an arithmetic number, because the mean of its divisors is an integer number (2697408).
Almost surely, 250149572 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50149572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64737792).
50149572 is an abundant number, since it is smaller than the sum of its proper divisors (79326012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50149572 is a wasteful number, since it uses less digits than its factorization.
50149572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5440 (or 5438 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 33.
The square root of 50149572 is about 7081.6362516017. The cubic root of 50149572 is about 368.7701361407.
It can be divided in two parts, 50149 and 572, that added together give a triangular number (50721 = T318).
The spelling of 50149572 in words is "fifty million, one hundred forty-nine thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •