Base | Representation |
---|---|
bin | 11011110011111000001000… |
… | …10010000010011010111011 |
3 | 22000112110121112111210212112 |
4 | 31321330010102002122323 |
5 | 31003440203424240430 |
6 | 334022421333002535 |
7 | 15611245305620561 |
oct | 1571740422023273 |
9 | 260473545453775 |
10 | 61156111165115 |
11 | 18539185463a2a |
12 | 6a38569a8344b |
13 | 2817cc55149c5 |
14 | 1115d85dd9a31 |
15 | 710c2668e195 |
hex | 379f044826bb |
61156111165115 has 48 divisors (see below), whose sum is σ = 76868222846688. Its totient is φ = 46705416350208.
The previous prime is 61156111165109. The next prime is 61156111165139. The reversal of 61156111165115 is 51156111165116.
61156111165115 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 61156111165115 - 210 = 61156111164091 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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, 6744906812 + ... + 6744915878.
It is an arithmetic number, because the mean of its divisors is an integer number (1601421309306).
Almost surely, 261156111165115 is an apocalyptic number.
61156111165115 is a deficient number, since it is larger than the sum of its proper divisors (15712111681573).
61156111165115 is a wasteful number, since it uses less digits than its factorization.
61156111165115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13868 (or 13845 counting only the distinct ones).
The product of its digits is 27000, while the sum is 41.
Subtracting from 61156111165115 its reverse (51156111165116), we obtain a palindrome (9999999999999).
The spelling of 61156111165115 in words is "sixty-one trillion, one hundred fifty-six billion, one hundred eleven million, one hundred sixty-five thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •