Base | Representation |
---|---|
bin | 10110110000110100110001… |
… | …01011111000000010010011 |
3 | 20120020022120101222022100121 |
4 | 23120122120223320002103 |
5 | 23030104403242144011 |
6 | 254243243144131111 |
7 | 13354302040022422 |
oct | 1330323053700223 |
9 | 216208511868317 |
10 | 50056110506131 |
11 | 14a4974a469904 |
12 | 5745262166a97 |
13 | 21c136a4102b2 |
14 | c50a2b6b12b9 |
15 | 5bc11abb9e71 |
hex | 2d8698af8093 |
50056110506131 has 2 divisors, whose sum is σ = 50056110506132. Its totient is φ = 50056110506130.
The previous prime is 50056110506063. The next prime is 50056110506147. The reversal of 50056110506131 is 13160501165005.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50056110506131 - 211 = 50056110504083 is a prime.
It is a super-2 number, since 2×500561105061312 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50056110506431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25028055253065 + 25028055253066.
It is an arithmetic number, because the mean of its divisors is an integer number (25028055253066).
Almost surely, 250056110506131 is an apocalyptic number.
50056110506131 is a deficient number, since it is larger than the sum of its proper divisors (1).
50056110506131 is an equidigital number, since it uses as much as digits as its factorization.
50056110506131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 34.
The spelling of 50056110506131 in words is "fifty trillion, fifty-six billion, one hundred ten million, five hundred six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •