Base | Representation |
---|---|
bin | 110110010010010010… |
… | …0011110111000011101 |
3 | 102010220111102202012121 |
4 | 1230210210132320131 |
5 | 3402222340113240 |
6 | 125315515502541 |
7 | 11264621523031 |
oct | 1544444367035 |
9 | 363814382177 |
10 | 116577660445 |
11 | 45493060824 |
12 | 1a715757a51 |
13 | acbb16c28c |
14 | 58dca021c1 |
15 | 30747d904a |
hex | 1b2491ee1d |
116577660445 has 8 divisors (see below), whose sum is σ = 139896563040. Its totient is φ = 93259881360.
The previous prime is 116577660443. The next prime is 116577660449. The reversal of 116577660445 is 544066775611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 116577660445 - 21 = 116577660443 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116577660392 and 116577660401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116577660443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32655 + ... + 483964.
It is an arithmetic number, because the mean of its divisors is an integer number (17487070380).
Almost surely, 2116577660445 is an apocalyptic number.
It is an amenable number.
116577660445 is a deficient number, since it is larger than the sum of its proper divisors (23318902595).
116577660445 is an equidigital number, since it uses as much as digits as its factorization.
116577660445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561755.
The product of its (nonzero) digits is 4233600, while the sum is 52.
It can be divided in two parts, 1165776 and 60445, that added together give a palindrome (1226221).
The spelling of 116577660445 in words is "one hundred sixteen billion, five hundred seventy-seven million, six hundred sixty thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •