Base | Representation |
---|---|
bin | 101111100000000001… |
… | …100000100001100000 |
3 | 11212122111101120000220 |
4 | 233200001200201200 |
5 | 1313423300211000 |
6 | 35232554043040 |
7 | 3453622316562 |
oct | 574001404140 |
9 | 155574346026 |
10 | 51003132000 |
11 | 1a6a2a35a67 |
12 | 9a74a19480 |
13 | 4a6a835662 |
14 | 267ba55332 |
15 | 14d79941a0 |
hex | be0060860 |
51003132000 has 96 divisors (see below), whose sum is σ = 167086299744. Its totient is φ = 13600832000.
The previous prime is 51003131939. The next prime is 51003132023. The reversal of 51003132000 is 23130015.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2113131 + ... + 2137130.
It is an arithmetic number, because the mean of its divisors is an integer number (1740482289).
Almost surely, 251003132000 is an apocalyptic number.
51003132000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
51003132000 is an abundant number, since it is smaller than the sum of its proper divisors (116083167744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51003132000 is a wasteful number, since it uses less digits than its factorization.
51003132000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4250289 (or 4250271 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 15.
Adding to 51003132000 its reverse (23130015), we get a palindrome (51026262015).
The spelling of 51003132000 in words is "fifty-one billion, three million, one hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •