Base | Representation |
---|---|
bin | 10111001100010011111011… |
… | …11111110100110011011000 |
3 | 20200120121100101221212021010 |
4 | 23212021331333310303120 |
5 | 23141043114210243211 |
6 | 300245155355213520 |
7 | 13512445211342121 |
oct | 1346117577646330 |
9 | 220517311855233 |
10 | 51000555556056 |
11 | 1528323a036517 |
12 | 58782baa472a0 |
13 | 225c440b25bc2 |
14 | c84623749048 |
15 | 5d69950654a6 |
hex | 2e627dff4cd8 |
51000555556056 has 128 divisors (see below), whose sum is σ = 135840917548800. Its totient is φ = 15900855336960.
The previous prime is 51000555556043. The next prime is 51000555556061. The reversal of 51000555556056 is 65065555500015.
It is a junction number, because it is equal to n+sod(n) for n = 51000555555996 and 51000555556014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 76126915 + ... + 76793933.
It is an arithmetic number, because the mean of its divisors is an integer number (1061257168350).
Almost surely, 251000555556056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51000555556056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67920458774400).
51000555556056 is an abundant number, since it is smaller than the sum of its proper divisors (84840361992744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51000555556056 is a wasteful number, since it uses less digits than its factorization.
51000555556056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 668209 (or 668205 counting only the distinct ones).
The product of its (nonzero) digits is 2812500, while the sum is 48.
The spelling of 51000555556056 in words is "fifty-one trillion, five hundred fifty-five million, five hundred fifty-six thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •