Base | Representation |
---|---|
bin | 101111100001010100… |
… | …111011111010010100 |
3 | 11212201000112200012210 |
4 | 233201110323322110 |
5 | 1313444400032012 |
6 | 35235054513420 |
7 | 3454306235106 |
oct | 574124737224 |
9 | 155630480183 |
10 | 51025002132 |
11 | 1a704313355 |
12 | 9a80205870 |
13 | 4a72222070 |
14 | 2680909576 |
15 | 14d986423c |
hex | be153be94 |
51025002132 has 96 divisors (see below), whose sum is σ = 136979852800. Its totient is φ = 14651632512.
The previous prime is 51025002131. The next prime is 51025002143. The reversal of 51025002132 is 23120052015.
It is a junction number, because it is equal to n+sod(n) for n = 51025002099 and 51025002108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51025002131) 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, 70119 + ... + 327057.
Almost surely, 251025002132 is an apocalyptic number.
51025002132 is a gapful number since it is divisible by the number (52) 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 51025002132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68489926400).
51025002132 is an abundant number, since it is smaller than the sum of its proper divisors (85954850668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51025002132 is a wasteful number, since it uses less digits than its factorization.
51025002132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257045 (or 257043 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
Adding to 51025002132 its reverse (23120052015), we get a palindrome (74145054147).
The spelling of 51025002132 in words is "fifty-one billion, twenty-five million, two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •