Base | Representation |
---|---|
bin | 100100100111000011001… |
… | …0010100010101101110100 |
3 | 122211000121000110002201222 |
4 | 1021032012102202231310 |
5 | 1124414314341230343 |
6 | 14411302414005512 |
7 | 1026345134603444 |
oct | 111160622425564 |
9 | 18730530402658 |
10 | 5031659711348 |
11 | 166aa07806266 |
12 | 6932047a6898 |
13 | 2a663926a88a |
14 | 1357683ca124 |
15 | 8ad41de1a68 |
hex | 493864a2b74 |
5031659711348 has 12 divisors (see below), whose sum is σ = 8806279767012. Its totient is φ = 2515579777920.
The previous prime is 5031659711347. The next prime is 5031659711387. The reversal of 5031659711348 is 8431179561305.
It can be written as a sum of positive squares in 2 ways, for example, as 1775988006244 + 3255671705104 = 1332662^2 + 1804348^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 5031659711348.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5031659711347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62474165 + ... + 62554652.
It is an arithmetic number, because the mean of its divisors is an integer number (733856647251).
Almost surely, 25031659711348 is an apocalyptic number.
It is an amenable number.
5031659711348 is a deficient number, since it is larger than the sum of its proper divisors (3774620055664).
5031659711348 is a wasteful number, since it uses less digits than its factorization.
5031659711348 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125038882 (or 125038880 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 53.
The spelling of 5031659711348 in words is "five trillion, thirty-one billion, six hundred fifty-nine million, seven hundred eleven thousand, three hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •