Base | Representation |
---|---|
bin | 101111101001011100… |
… | …100101001000010100 |
3 | 11220001111212110002001 |
4 | 233221130211020110 |
5 | 1314234233124300 |
6 | 35300402325044 |
7 | 3460552140406 |
oct | 575134451024 |
9 | 156044773061 |
10 | 51161223700 |
11 | 1a7741a4664 |
12 | 9ab9959784 |
13 | 4a94508642 |
14 | 2694a48b76 |
15 | 14e67c116a |
hex | be9725214 |
51161223700 has 72 divisors (see below), whose sum is σ = 113682459968. Its totient is φ = 19974366720.
The previous prime is 51161223691. The next prime is 51161223727. The reversal of 51161223700 is 732216115.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7663564 + ... + 7670236.
Almost surely, 251161223700 is an apocalyptic number.
51161223700 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 51161223700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56841229984).
51161223700 is an abundant number, since it is smaller than the sum of its proper divisors (62521236268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51161223700 is a wasteful number, since it uses less digits than its factorization.
51161223700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8513 (or 8506 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 28.
Adding to 51161223700 its reverse (732216115), we get a palindrome (51893439815).
The spelling of 51161223700 in words is "fifty-one billion, one hundred sixty-one million, two hundred twenty-three thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •