Base | Representation |
---|---|
bin | 10111001110110100000011… |
… | …10010010110110100010110 |
3 | 20200212211020022100212100121 |
4 | 23213122001302112310112 |
5 | 23144000142212331100 |
6 | 300352453403102154 |
7 | 13521610360213066 |
oct | 1347320162266426 |
9 | 220784208325317 |
10 | 51086518480150 |
11 | 1530674194a73a |
12 | 5890aab81195a |
13 | 2267590444b6a |
14 | c8885a4013a6 |
15 | 5d8d26c9651a |
hex | 2e7681c96d16 |
51086518480150 has 48 divisors (see below), whose sum is σ = 96697699482384. Its totient is φ = 20075645969280.
The previous prime is 51086518480117. The next prime is 51086518480157. The reversal of 51086518480150 is 5108481568015.
51086518480150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51086518480157) by changing a digit.
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, 19192417 + ... + 21691516.
It is an arithmetic number, because the mean of its divisors is an integer number (2014535405883).
Almost surely, 251086518480150 is an apocalyptic number.
51086518480150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51086518480150 is a deficient number, since it is larger than the sum of its proper divisors (45611181002234).
51086518480150 is a wasteful number, since it uses less digits than its factorization.
51086518480150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40884385 (or 40884380 counting only the distinct ones).
The product of its (nonzero) digits is 1536000, while the sum is 52.
The spelling of 51086518480150 in words is "fifty-one trillion, eighty-six billion, five hundred eighteen million, four hundred eighty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •