Base | Representation |
---|---|
bin | 110000000100001011… |
… | …011000100111000000 |
3 | 11221012202202110000000 |
4 | 300010023120213000 |
5 | 1321144040411200 |
6 | 35413103000000 |
7 | 3504636135000 |
oct | 600413304700 |
9 | 157182673000 |
10 | 51609700800 |
11 | 1a984370099 |
12 | a003b99000 |
13 | 4b363c10c8 |
14 | 26d842c000 |
15 | 1520d5d300 |
hex | c042d89c0 |
51609700800 has 1344 divisors, whose sum is σ = 227275136000. Its totient is φ = 11522165760.
The previous prime is 51609700783. The next prime is 51609700811. The reversal of 51609700800 is 800790615.
It is a tau number, because it is divible by the number of its divisors (1344).
It is a super-2 number, since 2×516097008002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 1200225579 + ... + 1200225621.
Almost surely, 251609700800 is an apocalyptic number.
51609700800 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51609700800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (113637568000).
51609700800 is an abundant number, since it is smaller than the sum of its proper divisors (175665435200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51609700800 is an frugal number, since it uses more digits than its factorization.
51609700800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107 (or 60 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The spelling of 51609700800 in words is "fifty-one billion, six hundred nine million, seven hundred thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •