Base | Representation |
---|---|
bin | 11000010110101010000111… |
… | …011011010001011010111001 |
3 | 112001020122001122222121112120 |
4 | 120112222013123101122321 |
5 | 103014343110111013144 |
6 | 1015445421534431453 |
7 | 31363311530206635 |
oct | 3026520733213271 |
9 | 461218048877476 |
10 | 107110166501049 |
11 | 311461916a72a8 |
12 | 1001a802062589 |
13 | 479c5a35c6caa |
14 | 1c642343addc5 |
15 | c5b2aba04e19 |
hex | 616a876d16b9 |
107110166501049 has 8 divisors (see below), whose sum is σ = 142825651050240. Its totient is φ = 71400729809616.
The previous prime is 107110166501017. The next prime is 107110166501053. The reversal of 107110166501049 is 940105661011701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107110166501049 - 25 = 107110166501017 is a prime.
It is a super-2 number, since 2×1071101665010492 (a number of 29 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 107110166501049.
It is not an unprimeable number, because it can be changed into a prime (107110166501059) 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, 1511923114 + ... + 1511993955.
It is an arithmetic number, because the mean of its divisors is an integer number (17853206381280).
Almost surely, 2107110166501049 is an apocalyptic number.
It is an amenable number.
107110166501049 is a deficient number, since it is larger than the sum of its proper divisors (35715484549191).
107110166501049 is a wasteful number, since it uses less digits than its factorization.
107110166501049 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3023928879.
The product of its (nonzero) digits is 45360, while the sum is 42.
The spelling of 107110166501049 in words is "one hundred seven trillion, one hundred ten billion, one hundred sixty-six million, five hundred one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •