Base | Representation |
---|---|
bin | 1011111110000… |
… | …0010010101100 |
3 | 10111110111212220 |
4 | 2333200102230 |
5 | 100322424042 |
6 | 4551555340 |
7 | 1146464565 |
oct | 277402254 |
9 | 114414786 |
10 | 50201772 |
11 | 26379375 |
12 | 1498bb50 |
13 | a5291ba |
14 | 694b16c |
15 | 46198ec |
hex | 2fe04ac |
50201772 has 24 divisors (see below), whose sum is σ = 120916992. Its totient is φ = 16194000.
The previous prime is 50201771. The next prime is 50201773. The reversal of 50201772 is 27710205.
50201772 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 (50201771) and next prime (50201773).
It is not an unprimeable number, because it can be changed into a prime (50201771) 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 7 ways as a sum of consecutive naturals, for example, 67104 + ... + 67847.
It is an arithmetic number, because the mean of its divisors is an integer number (5038208).
Almost surely, 250201772 is an apocalyptic number.
It is an amenable number.
50201772 is an abundant number, since it is smaller than the sum of its proper divisors (70715220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50201772 is a wasteful number, since it uses less digits than its factorization.
50201772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134989 (or 134987 counting only the distinct ones).
The product of its (nonzero) digits is 980, while the sum is 24.
The square root of 50201772 is about 7085.3208819361. The cubic root of 50201772 is about 368.8980410276.
Adding to 50201772 its reverse (27710205), we get a palindrome (77911977).
The spelling of 50201772 in words is "fifty million, two hundred one thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •