Base | Representation |
---|---|
bin | 101111100000011000… |
… | …010010110011111110 |
3 | 11212122220122000122200 |
4 | 233200120102303332 |
5 | 1313431312331100 |
6 | 35233330052330 |
7 | 3454024145163 |
oct | 574030226376 |
9 | 155586560580 |
10 | 51009105150 |
11 | 1a6a6345753 |
12 | 9a76a1a0a6 |
13 | 4a6bb47373 |
14 | 267c76c06a |
15 | 14d8273e00 |
hex | be0612cfe |
51009105150 has 36 divisors (see below), whose sum is σ = 137044463712. Its totient is φ = 13602427920.
The previous prime is 51009105101. The next prime is 51009105229. The reversal of 51009105150 is 5150190015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 56676334 + ... + 56677233.
Almost surely, 251009105150 is an apocalyptic number.
51009105150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51009105150 is an abundant number, since it is smaller than the sum of its proper divisors (86035358562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51009105150 is a wasteful number, since it uses less digits than its factorization.
51009105150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113353585 (or 113353577 counting only the distinct ones).
The product of its (nonzero) digits is 1125, while the sum is 27.
Adding to 51009105150 its reverse (5150190015), we get a palindrome (56159295165).
The spelling of 51009105150 in words is "fifty-one billion, nine million, one hundred five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •