Base | Representation |
---|---|
bin | 101111111010001111… |
… | …111110111000110000 |
3 | 11220210011022222022021 |
4 | 233322033332320300 |
5 | 1320323420242000 |
6 | 35344352521224 |
7 | 3500544265336 |
oct | 577217767060 |
9 | 156704288267 |
10 | 51443134000 |
11 | 1a8a9342a85 |
12 | 9b78250214 |
13 | 4b0aa4167b |
14 | 26c026db56 |
15 | 151140a11a |
hex | bfa3fee30 |
51443134000 has 120 divisors (see below), whose sum is σ = 130035552192. Its totient is φ = 19682185600.
The previous prime is 51443133983. The next prime is 51443134027. The reversal of 51443134000 is 43134415.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1033689 + ... + 1082311.
Almost surely, 251443134000 is an apocalyptic number.
51443134000 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 51443134000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65017776096).
51443134000 is an abundant number, since it is smaller than the sum of its proper divisors (78592418192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51443134000 is a wasteful number, since it uses less digits than its factorization.
51443134000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48692 (or 48653 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 51443134000 its reverse (43134415), we get a palindrome (51486268415).
The spelling of 51443134000 in words is "fifty-one billion, four hundred forty-three million, one hundred thirty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •