Base | Representation |
---|---|
bin | 10111000011111000110010… |
… | …00110100100011000011101 |
3 | 20122112221012202021220111022 |
4 | 23201330121012210120131 |
5 | 23121322313101004112 |
6 | 255504205134333525 |
7 | 13452520222010600 |
oct | 1341743106443035 |
9 | 218487182256438 |
10 | 50711100016157 |
11 | 15181502a18159 |
12 | 583019895a2a5 |
13 | 223b0617354c9 |
14 | c74604bb6337 |
15 | 5ce1a3460d72 |
hex | 2e1f191a461d |
50711100016157 has 12 divisors (see below), whose sum is σ = 58993276093596. Its totient is φ = 43464584560320.
The previous prime is 50711100016099. The next prime is 50711100016231. The reversal of 50711100016157 is 75161000111705.
It can be written as a sum of positive squares in 2 ways, for example, as 24385878498436 + 26325221517721 = 4938206^2 + 5130811^2 .
It is a de Polignac number, because none of the positive numbers 2k-50711100016157 is a prime.
It is a super-2 number, since 2×507111000161572 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50711100016957) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23635208 + ... + 25691345.
It is an arithmetic number, because the mean of its divisors is an integer number (4916106341133).
Almost surely, 250711100016157 is an apocalyptic number.
It is an amenable number.
50711100016157 is a deficient number, since it is larger than the sum of its proper divisors (8282176077439).
50711100016157 is a wasteful number, since it uses less digits than its factorization.
50711100016157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49347548 (or 49347541 counting only the distinct ones).
The product of its (nonzero) digits is 7350, while the sum is 35.
The spelling of 50711100016157 in words is "fifty trillion, seven hundred eleven billion, one hundred million, sixteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •