Base | Representation |
---|---|
bin | 10111001111111011010111… |
… | …11100110000101110111110 |
3 | 20201000111001200121210012201 |
4 | 23213331223330300232332 |
5 | 23200112101021032104 |
6 | 300422224555022114 |
7 | 13524434241534346 |
oct | 1347755374605676 |
9 | 221014050553181 |
10 | 51124806814654 |
11 | 153209aa6980a1 |
12 | 58983b643a93a |
13 | 226b0829c51b1 |
14 | c8a64d52bd26 |
15 | 5d9d183730a4 |
hex | 2e7f6bf30bbe |
51124806814654 has 8 divisors (see below), whose sum is σ = 76759488462888. Its totient is φ = 25538310660360.
The previous prime is 51124806814649. The next prime is 51124806814657. The reversal of 51124806814654 is 45641860842115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×511248068146542 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51124806814595 and 51124806814604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51124806814657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12046370832 + ... + 12046375075.
It is an arithmetic number, because the mean of its divisors is an integer number (9594936057861).
Almost surely, 251124806814654 is an apocalyptic number.
51124806814654 is a deficient number, since it is larger than the sum of its proper divisors (25634681648234).
51124806814654 is a wasteful number, since it uses less digits than its factorization.
51124806814654 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24092746970.
The product of its (nonzero) digits is 7372800, while the sum is 55.
The spelling of 51124806814654 in words is "fifty-one trillion, one hundred twenty-four billion, eight hundred six million, eight hundred fourteen thousand, six hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •