Base | Representation |
---|---|
bin | 110001110110101011… |
… | …0001000001101101001 |
3 | 101020100021120021202010 |
4 | 1203231112020031221 |
5 | 3223230132403410 |
6 | 121103325230133 |
7 | 10510035215244 |
oct | 1435526101551 |
9 | 336307507663 |
10 | 107061216105 |
11 | 4144a2a1298 |
12 | 188ba702349 |
13 | a1326ca01c |
14 | 5278b9425b |
15 | 2bb90e6c20 |
hex | 18ed588369 |
107061216105 has 16 divisors (see below), whose sum is σ = 174942584064. Its totient is φ = 55884435840.
The previous prime is 107061216103. The next prime is 107061216107. The reversal of 107061216105 is 501612160701.
It is an interprime number because it is at equal distance from previous prime (107061216103) and next prime (107061216107).
It is not a de Polignac number, because 107061216105 - 21 = 107061216103 is a prime.
It is a super-2 number, since 2×1070612161052 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (107061216103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 75929236 + ... + 75930645.
It is an arithmetic number, because the mean of its divisors is an integer number (10933911504).
Almost surely, 2107061216105 is an apocalyptic number.
107061216105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
107061216105 is a deficient number, since it is larger than the sum of its proper divisors (67881367959).
107061216105 is a wasteful number, since it uses less digits than its factorization.
107061216105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151859936.
The product of its (nonzero) digits is 2520, while the sum is 30.
Adding to 107061216105 its reverse (501612160701), we get a palindrome (608673376806).
The spelling of 107061216105 in words is "one hundred seven billion, sixty-one million, two hundred sixteen thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •