Base | Representation |
---|---|
bin | 11010110001101000100100… |
… | …11101000000000011001011 |
3 | 21201110212121120101020002120 |
4 | 31120310102131000003023 |
5 | 30204142233130100011 |
6 | 325121034523502323 |
7 | 15254640456236253 |
oct | 1530642235000313 |
9 | 251425546336076 |
10 | 58880016253131 |
11 | 178409691a3337 |
12 | 672b4123879a3 |
13 | 26b1491899438 |
14 | 1077b451b8963 |
15 | 6c190e9e6a06 |
hex | 358d127400cb |
58880016253131 has 32 divisors (see below), whose sum is σ = 85499165088000. Its totient is φ = 35900461231488.
The previous prime is 58880016253129. The next prime is 58880016253133. The reversal of 58880016253131 is 13135261008885.
It is an interprime number because it is at equal distance from previous prime (58880016253129) and next prime (58880016253133).
It is not a de Polignac number, because 58880016253131 - 21 = 58880016253129 is a prime.
It is a super-2 number, since 2×588800162531312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (58880016253133) 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 31 ways as a sum of consecutive naturals, for example, 10666456 + ... + 15216218.
It is an arithmetic number, because the mean of its divisors is an integer number (2671848909000).
Almost surely, 258880016253131 is an apocalyptic number.
58880016253131 is a deficient number, since it is larger than the sum of its proper divisors (26619148834869).
58880016253131 is a wasteful number, since it uses less digits than its factorization.
58880016253131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4557643.
The product of its (nonzero) digits is 1382400, while the sum is 51.
The spelling of 58880016253131 in words is "fifty-eight trillion, eight hundred eighty billion, sixteen million, two hundred fifty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •