Base | Representation |
---|---|
bin | 100100101111101101111… |
… | …0110100001011110001101 |
3 | 122212210122100112121100100 |
4 | 1021133123312201132031 |
5 | 1130220430404412411 |
6 | 14424021521521313 |
7 | 1030604344566522 |
oct | 111373366413615 |
9 | 18783570477310 |
10 | 5050275075981 |
11 | 167789a690233 |
12 | 69693aaa3239 |
13 | 2a8314b16335 |
14 | 13661283d149 |
15 | 8b581300456 |
hex | 497dbda178d |
5050275075981 has 6 divisors (see below), whose sum is σ = 7294841776430. Its totient is φ = 3366850050648.
The previous prime is 5050275075961. The next prime is 5050275076013. The reversal of 5050275075981 is 1895705720505.
5050275075981 is a `hidden beast` number, since 5 + 0 + 5 + 0 + 2 + 7 + 507 + 59 + 81 = 666.
It can be written as a sum of positive squares in only one way, i.e., 4308256501956 + 742018574025 = 2075634^2 + 861405^2 .
It is not a de Polignac number, because 5050275075981 - 241 = 2851251820429 is a prime.
It is a super-2 number, since 2×50502750759812 (a number of 26 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 (5050275075961) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 280570837546 + ... + 280570837563.
Almost surely, 25050275075981 is an apocalyptic number.
It is an amenable number.
5050275075981 is a deficient number, since it is larger than the sum of its proper divisors (2244566700449).
5050275075981 is a wasteful number, since it uses less digits than its factorization.
5050275075981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561141675115 (or 561141675112 counting only the distinct ones).
The product of its (nonzero) digits is 4410000, while the sum is 54.
The spelling of 5050275075981 in words is "five trillion, fifty billion, two hundred seventy-five million, seventy-five thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •