Base | Representation |
---|---|
bin | 101111011011101010… |
… | …100101101101000000 |
3 | 11212110101210211102100 |
4 | 233123222211231000 |
5 | 1313301040440130 |
6 | 35221422550400 |
7 | 3452043661602 |
oct | 573352455500 |
9 | 155411724370 |
10 | 50930015040 |
11 | 1a665736123 |
12 | 9a54438400 |
13 | 4a58645198 |
14 | 2672061172 |
15 | 14d134ec60 |
hex | bdbaa5b40 |
50930015040 has 672 divisors, whose sum is σ = 189491477760. Its totient is φ = 12525207552.
The previous prime is 50930015011. The next prime is 50930015057. The reversal of 50930015040 is 4051003905.
50930015040 is a `hidden beast` number, since 509 + 3 + 0 + 0 + 150 + 4 + 0 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 50930014995 and 50930015013.
It is a congruent number.
It is an unprimeable number.
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 95 ways as a sum of consecutive naturals, for example, 312453999 + ... + 312454161.
Almost surely, 250930015040 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 50930015040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94745738880).
50930015040 is an abundant number, since it is smaller than the sum of its proper divisors (138561462720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50930015040 is a wasteful number, since it uses less digits than its factorization.
50930015040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351 (or 338 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
Adding to 50930015040 its reverse (4051003905), we get a palindrome (54981018945).
The spelling of 50930015040 in words is "fifty billion, nine hundred thirty million, fifteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •