Base | Representation |
---|---|
bin | 110001011010100001… |
… | …0101110101010010111 |
3 | 101010220110010011010110 |
4 | 1202311002232222113 |
5 | 3214311322402430 |
6 | 120425503054103 |
7 | 10444445162565 |
oct | 1426502565227 |
9 | 333813104113 |
10 | 106116606615 |
11 | 41005070198 |
12 | 186962a1333 |
13 | a011ab49b6 |
14 | 51c9544a35 |
15 | 2b612077b0 |
hex | 18b50aea97 |
106116606615 has 64 divisors (see below), whose sum is σ = 184261939200. Its totient is φ = 52004519424.
The previous prime is 106116606611. The next prime is 106116606619. The reversal of 106116606615 is 516606611601.
It is an interprime number because it is at equal distance from previous prime (106116606611) and next prime (106116606619).
It is not a de Polignac number, because 106116606615 - 22 = 106116606611 is a prime.
It is a super-2 number, since 2×1061166066152 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106116606611) 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 63 ways as a sum of consecutive naturals, for example, 955821 + ... + 1061049.
It is an arithmetic number, because the mean of its divisors is an integer number (2879092800).
Almost surely, 2106116606615 is an apocalyptic number.
106116606615 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106116606615 is a deficient number, since it is larger than the sum of its proper divisors (78145332585).
106116606615 is a wasteful number, since it uses less digits than its factorization.
106116606615 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105376.
The product of its (nonzero) digits is 38880, while the sum is 39.
The spelling of 106116606615 in words is "one hundred six billion, one hundred sixteen million, six hundred six thousand, six hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •