Base | Representation |
---|---|
bin | 11011110000010000001000… |
… | …01110000000000111011001 |
3 | 22000002120010002002122201001 |
4 | 31320020010032000013121 |
5 | 30444420111322234023 |
6 | 333445302040425001 |
7 | 15566245565636341 |
oct | 1570100416000731 |
9 | 260076102078631 |
10 | 61031556055513 |
11 | 184a037933861a |
12 | 6a183a8778161 |
13 | 28093356c9b14 |
14 | 110dd2bb1dd21 |
15 | 70c8868616ad |
hex | 3782043801d9 |
61031556055513 has 4 divisors (see below), whose sum is σ = 61031579918800. Its totient is φ = 61031532192228.
The previous prime is 61031556055489. The next prime is 61031556055601. The reversal of 61031556055513 is 31555065513016.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-61031556055513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61031556055013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7561863 + ... + 13388236.
It is an arithmetic number, because the mean of its divisors is an integer number (15257894979700).
Almost surely, 261031556055513 is an apocalyptic number.
It is an amenable number.
61031556055513 is a deficient number, since it is larger than the sum of its proper divisors (23863287).
61031556055513 is a wasteful number, since it uses less digits than its factorization.
61031556055513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23863286.
The product of its (nonzero) digits is 1012500, while the sum is 46.
The spelling of 61031556055513 in words is "sixty-one trillion, thirty-one billion, five hundred fifty-six million, fifty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •