Base | Representation |
---|---|
bin | 101110111010011001… |
… | …101001010000110000 |
3 | 11211000111122220212100 |
4 | 232322121221100300 |
5 | 1311130203100130 |
6 | 35050205100400 |
7 | 3432156204213 |
oct | 567231512060 |
9 | 154014586770 |
10 | 50371925040 |
11 | 1a3a9702918 |
12 | 9919557700 |
13 | 4999b31608 |
14 | 261bca777a |
15 | 149c35ec60 |
hex | bba669430 |
50371925040 has 120 divisors (see below), whose sum is σ = 172357651440. Its totient is φ = 13179059712.
The previous prime is 50371925027. The next prime is 50371925053. The reversal of 50371925040 is 4052917305.
It is an interprime number because it is at equal distance from previous prime (50371925027) and next prime (50371925053).
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 50371924986 and 50371925004.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 621850 + ... + 698169.
It is an arithmetic number, because the mean of its divisors is an integer number (1436313762).
Almost surely, 250371925040 is an apocalyptic number.
It is an amenable number.
50371925040 is an abundant number, since it is smaller than the sum of its proper divisors (121985726400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50371925040 is a wasteful number, since it uses less digits than its factorization.
50371925040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1320091 (or 1320082 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 36.
The spelling of 50371925040 in words is "fifty billion, three hundred seventy-one million, nine hundred twenty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •