Base | Representation |
---|---|
bin | 1011111011110… |
… | …1111011001110 |
3 | 10111012100210100 |
4 | 2332331323032 |
5 | 100303423011 |
6 | 4544551530 |
7 | 1145340312 |
oct | 276757316 |
9 | 114170710 |
10 | 50061006 |
11 | 26292636 |
12 | 149225a6 |
13 | a4aa0c8 |
14 | 6911b42 |
15 | 45dcd56 |
hex | 2fbdece |
50061006 has 24 divisors (see below), whose sum is σ = 108664920. Its totient is φ = 16656336.
The previous prime is 50060977. The next prime is 50061007. The reversal of 50061006 is 60016005.
50061006 is a `hidden beast` number, since 50 + 0 + 610 + 0 + 6 = 666.
It is a super-2 number, since 2×500610062 = 5012208643464072, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a self number, because there is not a number n which added to its sum of digits gives 50061006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50061007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8896 + ... + 13388.
It is an arithmetic number, because the mean of its divisors is an integer number (4527705).
Almost surely, 250061006 is an apocalyptic number.
50061006 is an abundant number, since it is smaller than the sum of its proper divisors (58603914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50061006 is a wasteful number, since it uses less digits than its factorization.
50061006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5120 (or 5117 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 50061006 is about 7075.3802724659. The cubic root of 50061006 is about 368.5529209847.
The spelling of 50061006 in words is "fifty million, sixty-one thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •