Base | Representation |
---|---|
bin | 101111101001001110… |
… | …111000011010111100 |
3 | 11220001021010000011001 |
4 | 233221032320122330 |
5 | 1314232323221300 |
6 | 35300153340044 |
7 | 3460506463126 |
oct | 575116703274 |
9 | 156037100131 |
10 | 51157632700 |
11 | 1a772171699 |
12 | 9ab8707624 |
13 | 4a9384bca5 |
14 | 2694392216 |
15 | 14e631216a |
hex | be93b86bc |
51157632700 has 108 divisors (see below), whose sum is σ = 120053800440. Its totient is φ = 18897845120.
The previous prime is 51157632689. The next prime is 51157632731. The reversal of 51157632700 is 723675115.
It is a super-3 number, since 3×511576327003 (a number of 33 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51157632700.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1517427 + ... + 1550773.
Almost surely, 251157632700 is an apocalyptic number.
51157632700 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 51157632700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60026900220).
51157632700 is an abundant number, since it is smaller than the sum of its proper divisors (68896167740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51157632700 is a wasteful number, since it uses less digits than its factorization.
51157632700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33436 (or 33406 counting only the distinct ones).
The product of its (nonzero) digits is 44100, while the sum is 37.
The spelling of 51157632700 in words is "fifty-one billion, one hundred fifty-seven million, six hundred thirty-two thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •