Base | Representation |
---|---|
bin | 110001100000111010… |
… | …1011001101010101111 |
3 | 101011110101221110121220 |
4 | 1203001311121222233 |
5 | 3220231242412214 |
6 | 120503050554423 |
7 | 10452662266551 |
oct | 1430165315257 |
9 | 334411843556 |
10 | 106331216559 |
11 | 41105221887 |
12 | 18736138a13 |
13 | a0473b5c29 |
14 | 5209c4b4d1 |
15 | 2b74e9a9a9 |
hex | 18c1d59aaf |
106331216559 has 8 divisors (see below), whose sum is σ = 142794919680. Its totient is φ = 70377495576.
The previous prime is 106331216549. The next prime is 106331216569. The reversal of 106331216559 is 955612133601.
It is an interprime number because it is at equal distance from previous prime (106331216549) and next prime (106331216569).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106331216559 - 24 = 106331216543 is a prime.
It is a super-2 number, since 2×1063312165592 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106331216559.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106331216539) 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, 127495047 + ... + 127495880.
It is an arithmetic number, because the mean of its divisors is an integer number (17849364960).
Almost surely, 2106331216559 is an apocalyptic number.
106331216559 is a deficient number, since it is larger than the sum of its proper divisors (36463703121).
106331216559 is a wasteful number, since it uses less digits than its factorization.
106331216559 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 254991069.
The product of its (nonzero) digits is 145800, while the sum is 42.
The spelling of 106331216559 in words is "one hundred six billion, three hundred thirty-one million, two hundred sixteen thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •