Base | Representation |
---|---|
bin | 10110110011111001010111… |
… | …01101111000111110011001 |
3 | 20120121102000002101100010010 |
4 | 23121330223231320332121 |
5 | 23033322033031000441 |
6 | 254403540305112133 |
7 | 13365026416123545 |
oct | 1331745355707631 |
9 | 216542002340103 |
10 | 50161656500121 |
11 | 14a8a491423311 |
12 | 57617b9328649 |
13 | 21cb2bac1858a |
14 | c55ba111ca25 |
15 | 5bec46c5c116 |
hex | 2d9f2bb78f99 |
50161656500121 has 16 divisors (see below), whose sum is σ = 67276130054400. Its totient is φ = 33244185703680.
The previous prime is 50161656500119. The next prime is 50161656500183. The reversal of 50161656500121 is 12100565616105.
It is not a de Polignac number, because 50161656500121 - 21 = 50161656500119 is a prime.
It is a super-2 number, since 2×501616565001212 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50161656500121.
It is not an unprimeable number, because it can be changed into a prime (50161656500521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 479040 + ... + 10027601.
It is an arithmetic number, because the mean of its divisors is an integer number (4204758128400).
Almost surely, 250161656500121 is an apocalyptic number.
It is an amenable number.
50161656500121 is a deficient number, since it is larger than the sum of its proper divisors (17114473554279).
50161656500121 is a wasteful number, since it uses less digits than its factorization.
50161656500121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10516016.
The product of its (nonzero) digits is 54000, while the sum is 39.
The spelling of 50161656500121 in words is "fifty trillion, one hundred sixty-one billion, six hundred fifty-six million, five hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •