Base | Representation |
---|---|
bin | 1011111111000… |
… | …1101110110010 |
3 | 10111121010212110 |
4 | 2333301232302 |
5 | 100332220302 |
6 | 4553310150 |
7 | 1150213050 |
oct | 277615662 |
9 | 114533773 |
10 | 50273202 |
11 | 26418001 |
12 | 14a05356 |
13 | a552875 |
14 | 69691d0 |
15 | 4630b6c |
hex | 2ff1bb2 |
50273202 has 64 divisors (see below), whose sum is σ = 122757120. Its totient is φ = 13405824.
The previous prime is 50273191. The next prime is 50273207. The reversal of 50273202 is 20237205.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (50273207) 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 31 ways as a sum of consecutive naturals, for example, 57823 + ... + 58685.
It is an arithmetic number, because the mean of its divisors is an integer number (1918080).
Almost surely, 250273202 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50273202, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61378560).
50273202 is an abundant number, since it is smaller than the sum of its proper divisors (72483918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50273202 is a wasteful number, since it uses less digits than its factorization.
50273202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 967.
The product of its (nonzero) digits is 840, while the sum is 21.
The square root of 50273202 is about 7090.3597934096. The cubic root of 50273202 is about 369.0729213042.
The spelling of 50273202 in words is "fifty million, two hundred seventy-three thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •