Base | Representation |
---|---|
bin | 10110110000101100011110… |
… | …01101001101011011100000 |
3 | 20120012220001222222121111211 |
4 | 23120112033031031123200 |
5 | 23030021243031130211 |
6 | 254241225155315504 |
7 | 13354053464443513 |
oct | 1330261715153340 |
9 | 216186058877454 |
10 | 50051656505056 |
11 | 14a47874286988 |
12 | 574441a5abb94 |
13 | 21c0b0a7209bb |
14 | c50727d3ad7a |
15 | 5bbe59b65e21 |
hex | 2d858f34d6e0 |
50051656505056 has 12 divisors (see below), whose sum is σ = 98539198744392. Its totient is φ = 25025828252512.
The previous prime is 50051656505051. The next prime is 50051656505141. The reversal of 50051656505056 is 65050565615005.
50051656505056 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×500516565050562 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50051656505051) 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 as a sum of consecutive naturals, namely, 782057132860 + ... + 782057132923.
It is an arithmetic number, because the mean of its divisors is an integer number (8211599895366).
Almost surely, 250051656505056 is an apocalyptic number.
It is an amenable number.
50051656505056 is a deficient number, since it is larger than the sum of its proper divisors (48487542239336).
50051656505056 is a wasteful number, since it uses less digits than its factorization.
50051656505056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1564114265793 (or 1564114265785 counting only the distinct ones).
The product of its (nonzero) digits is 3375000, while the sum is 49.
The spelling of 50051656505056 in words is "fifty trillion, fifty-one billion, six hundred fifty-six million, five hundred five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •