Base | Representation |
---|---|
bin | 101100100000011100000… |
… | …1010000010101101100001 |
3 | 210122202222112202000112201 |
4 | 1121000320022002231201 |
5 | 1300210031222224040 |
6 | 21002033315453201 |
7 | 1200636233406364 |
oct | 131007012025541 |
9 | 23582875660481 |
10 | 6116975586145 |
11 | 1a49216281696 |
12 | 8296168b7201 |
13 | 354a9ca95468 |
14 | 1720c55b60db |
15 | a91b3675a9a |
hex | 59038282b61 |
6116975586145 has 4 divisors (see below), whose sum is σ = 7340370703380. Its totient is φ = 4893580468912.
The previous prime is 6116975586097. The next prime is 6116975586149. The reversal of 6116975586145 is 5416855796116.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1315372728609 + 4801602857536 = 1146897^2 + 2191256^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6116975586145 is a prime.
It is a super-2 number, since 2×61169755861452 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (6116975586149) 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, 611697558610 + ... + 611697558619.
It is an arithmetic number, because the mean of its divisors is an integer number (1835092675845).
Almost surely, 26116975586145 is an apocalyptic number.
It is an amenable number.
6116975586145 is a deficient number, since it is larger than the sum of its proper divisors (1223395117235).
6116975586145 is a wasteful number, since it uses less digits than its factorization.
6116975586145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1223395117234.
The product of its digits is 54432000, while the sum is 64.
The spelling of 6116975586145 in words is "six trillion, one hundred sixteen billion, nine hundred seventy-five million, five hundred eighty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •