Base | Representation |
---|---|
bin | 100100111011010100110… |
… | …1000001010101111010111 |
3 | 122222011222120102112200200 |
4 | 1021312221220022233113 |
5 | 1131123003234141311 |
6 | 14443303221511543 |
7 | 1032446146250331 |
oct | 111665150125727 |
9 | 18864876375620 |
10 | 5075202255831 |
11 | 16874213aa414 |
12 | 69b736b725b3 |
13 | 2aa7882344b6 |
14 | 1378d926c451 |
15 | 8c03e8db556 |
hex | 49da9a0abd7 |
5075202255831 has 48 divisors (see below), whose sum is σ = 7831972512000. Its totient is φ = 3159920655360.
The previous prime is 5075202255821. The next prime is 5075202255847. The reversal of 5075202255831 is 1385522025705.
5075202255831 is a `hidden beast` number, since 5 + 0 + 75 + 2 + 0 + 22 + 558 + 3 + 1 = 666.
It is not a de Polignac number, because 5075202255831 - 225 = 5075168701399 is a prime.
It is a super-2 number, since 2×50752022558312 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5075202255821) 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 in 47 ways as a sum of consecutive naturals, for example, 17078425 + ... + 17373053.
It is an arithmetic number, because the mean of its divisors is an integer number (163166094000).
Almost surely, 25075202255831 is an apocalyptic number.
5075202255831 is a deficient number, since it is larger than the sum of its proper divisors (2756770256169).
5075202255831 is a wasteful number, since it uses less digits than its factorization.
5075202255831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296824 (or 296821 counting only the distinct ones).
The product of its (nonzero) digits is 840000, while the sum is 45.
The spelling of 5075202255831 in words is "five trillion, seventy-five billion, two hundred two million, two hundred fifty-five thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •