Base | Representation |
---|---|
bin | 110000010010011010… |
… | …101011010110100000 |
3 | 11221211102021022102000 |
4 | 300102122223112200 |
5 | 1322141214401002 |
6 | 35452515124000 |
7 | 3513566515110 |
oct | 602232532640 |
9 | 157742238360 |
10 | 51848590752 |
11 | 1aa971a5702 |
12 | a06bba3600 |
13 | 4b73a438ca |
14 | 271c055040 |
15 | 1536cea61c |
hex | c126ab5a0 |
51848590752 has 192 divisors, whose sum is σ = 173709930240. Its totient is φ = 14738347008.
The previous prime is 51848590733. The next prime is 51848590753. The reversal of 51848590752 is 25709584815.
51848590752 is a `hidden beast` number, since 5 + 1 + 8 + 48 + 590 + 7 + 5 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (51848590753) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1169698 + ... + 1213214.
It is an arithmetic number, because the mean of its divisors is an integer number (904739220).
Almost surely, 251848590752 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 51848590752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86854965120).
51848590752 is an abundant number, since it is smaller than the sum of its proper divisors (121861339488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51848590752 is a wasteful number, since it uses less digits than its factorization.
51848590752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43740 (or 43726 counting only the distinct ones).
The product of its (nonzero) digits is 4032000, while the sum is 54.
The spelling of 51848590752 in words is "fifty-one billion, eight hundred forty-eight million, five hundred ninety thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •