Base | Representation |
---|---|
bin | 11011111111000111000111… |
… | …01110110011101011101101 |
3 | 22001220100221121101202212221 |
4 | 31333203203232303223231 |
5 | 31031301221200143222 |
6 | 334520020032555341 |
7 | 15651161623561642 |
oct | 1577434356635355 |
9 | 261810847352787 |
10 | 61542112115437 |
11 | 18677954987088 |
12 | 6a9b3349b2b51 |
13 | 284551c7b78a5 |
14 | 112a922c91dc9 |
15 | 71acb90910c7 |
hex | 37f8e3bb3aed |
61542112115437 has 16 divisors (see below), whose sum is σ = 64258028880768. Its totient is φ = 58829546856960.
The previous prime is 61542112115389. The next prime is 61542112115443. The reversal of 61542112115437 is 73451121124516.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-61542112115437 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 61542112115393 and 61542112115402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61542112115137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1068948862 + ... + 1069006432.
It is an arithmetic number, because the mean of its divisors is an integer number (4016126805048).
Almost surely, 261542112115437 is an apocalyptic number.
It is an amenable number.
61542112115437 is a deficient number, since it is larger than the sum of its proper divisors (2715916765331).
61542112115437 is a wasteful number, since it uses less digits than its factorization.
61542112115437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85860.
The product of its digits is 201600, while the sum is 43.
The spelling of 61542112115437 in words is "sixty-one trillion, five hundred forty-two billion, one hundred twelve million, one hundred fifteen thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •