Base | Representation |
---|---|
bin | 11011111101110001011001… |
… | …01110010011110011101111 |
3 | 22001201222011101120211011112 |
4 | 31332320230232103303233 |
5 | 31030022444033101031 |
6 | 334442525323542235 |
7 | 15644642330002322 |
oct | 1576705456236357 |
9 | 261658141524145 |
10 | 61496092081391 |
11 | 1865a3898643a0 |
12 | 6a9243098a97b |
13 | 2841097473806 |
14 | 11285d8d7c7b9 |
15 | 7199c3d1562b |
hex | 37ee2cb93cef |
61496092081391 has 4 divisors (see below), whose sum is σ = 67086645906984. Its totient is φ = 55905538255800.
The previous prime is 61496092081367. The next prime is 61496092081429. The reversal of 61496092081391 is 19318029069416.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 61496092081391 - 226 = 61496024972527 is a prime.
It is a super-3 number, since 3×614960920813913 (a number of 42 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 61496092081391.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61496092081321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2795276912780 + ... + 2795276912801.
It is an arithmetic number, because the mean of its divisors is an integer number (16771661476746).
Almost surely, 261496092081391 is an apocalyptic number.
61496092081391 is a deficient number, since it is larger than the sum of its proper divisors (5590553825593).
61496092081391 is a wasteful number, since it uses less digits than its factorization.
61496092081391 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5590553825592.
The product of its (nonzero) digits is 5038848, while the sum is 59.
The spelling of 61496092081391 in words is "sixty-one trillion, four hundred ninety-six billion, ninety-two million, eighty-one thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •