Base | Representation |
---|---|
bin | 101111100000110100… |
… | …111110110111000000 |
3 | 11212200102210002202212 |
4 | 233200310332313000 |
5 | 1313440224004400 |
6 | 35234155201252 |
7 | 3454145106533 |
oct | 574064766700 |
9 | 155612702685 |
10 | 51016625600 |
11 | 1a6aa6119a6 |
12 | 9a79446228 |
13 | 4a7057b435 |
14 | 267d768a1a |
15 | 14d8c5c335 |
hex | be0d3edc0 |
51016625600 has 84 divisors (see below), whose sum is σ = 129582355008. Its totient is φ = 19748352000.
The previous prime is 51016625599. The next prime is 51016625641. The reversal of 51016625600 is 652661015.
It is a super-2 number, since 2×510166256002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
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 11 ways as a sum of consecutive naturals, for example, 464681 + ... + 563880.
Almost surely, 251016625600 is an apocalyptic number.
51016625600 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
51016625600 is an abundant number, since it is smaller than the sum of its proper divisors (78565729408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51016625600 is a wasteful number, since it uses less digits than its factorization.
51016625600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1028614 (or 1028599 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 32.
The spelling of 51016625600 in words is "fifty-one billion, sixteen million, six hundred twenty-five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •