Base | Representation |
---|---|
bin | 110110010001111011… |
… | …0010000111010011001 |
3 | 102010212122122012101122 |
4 | 1230203312100322121 |
5 | 3402211234411401 |
6 | 125314404055025 |
7 | 11264413531622 |
oct | 1544366207231 |
9 | 363778565348 |
10 | 116565544601 |
11 | 45487235a30 |
12 | 1a711694475 |
13 | acb87b963c |
14 | 58db16aa49 |
15 | 30736e421b |
hex | 1b23d90e99 |
116565544601 has 8 divisors (see below), whose sum is σ = 127172515008. Its totient is φ = 105960258000.
The previous prime is 116565544553. The next prime is 116565544643. The reversal of 116565544601 is 106445565611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116565544601 is a prime.
It is not an unprimeable number, because it can be changed into a prime (116565544661) 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, 273965 + ... + 555146.
It is an arithmetic number, because the mean of its divisors is an integer number (15896564376).
Almost surely, 2116565544601 is an apocalyptic number.
116565544601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
116565544601 is a deficient number, since it is larger than the sum of its proper divisors (10606970407).
116565544601 is a wasteful number, since it uses less digits than its factorization.
116565544601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841903.
The product of its (nonzero) digits is 432000, while the sum is 44.
It can be divided in two parts, 116565 and 544601, that added together give a palindrome (661166).
The spelling of 116565544601 in words is "one hundred sixteen billion, five hundred sixty-five million, five hundred forty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •