Base | Representation |
---|---|
bin | 11000001110101101100011… |
… | …011010001110011111000001 |
3 | 111222022102120110011022222101 |
4 | 120032231203122032133001 |
5 | 102431421234424304023 |
6 | 1014350512232310401 |
7 | 31306000526351521 |
oct | 3016554332163701 |
9 | 458272513138871 |
10 | 106564101400513 |
11 | 30a55644135a89 |
12 | bb50a05b42401 |
13 | 475cc4a9b64a3 |
14 | 1c45a312a5681 |
15 | c4be9bbe31ad |
hex | 60eb6368e7c1 |
106564101400513 has 8 divisors (see below), whose sum is σ = 109522699041888. Its totient is φ = 103627338428544.
The previous prime is 106564101400489. The next prime is 106564101400613. The reversal of 106564101400513 is 315004101465601.
It is a happy number.
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-106564101400513 is a prime.
It is a super-2 number, since 2×1065641014005132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106564101400213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5458657456 + ... + 5458676977.
It is an arithmetic number, because the mean of its divisors is an integer number (13690337380236).
Almost surely, 2106564101400513 is an apocalyptic number.
It is an amenable number.
106564101400513 is a deficient number, since it is larger than the sum of its proper divisors (2958597641375).
106564101400513 is a wasteful number, since it uses less digits than its factorization.
106564101400513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10917334703.
The product of its (nonzero) digits is 43200, while the sum is 37.
The spelling of 106564101400513 in words is "one hundred six trillion, five hundred sixty-four billion, one hundred one million, four hundred thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •