Base | Representation |
---|---|
bin | 110001101011001110… |
… | …0000101100011011110 |
3 | 101012100111102010001110 |
4 | 1203112130011203132 |
5 | 3221433241331420 |
6 | 121001240122450 |
7 | 10464360464262 |
oct | 1432634054336 |
9 | 335314363043 |
10 | 106676902110 |
11 | 4127236a519 |
12 | 18811a66426 |
13 | a0a0bbb3ac |
14 | 523db140a2 |
15 | 2b954d0ee0 |
hex | 18d67058de |
106676902110 has 16 divisors (see below), whose sum is σ = 256024565136. Its totient is φ = 28447173888.
The previous prime is 106676902099. The next prime is 106676902139. The reversal of 106676902110 is 11209676601.
It is a super-2 number, since 2×1066769021102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1777948339 + ... + 1777948398.
It is an arithmetic number, because the mean of its divisors is an integer number (16001535321).
Almost surely, 2106676902110 is an apocalyptic number.
106676902110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106676902110 is an abundant number, since it is smaller than the sum of its proper divisors (149347663026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106676902110 is a wasteful number, since it uses less digits than its factorization.
106676902110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3555896747.
The product of its (nonzero) digits is 27216, while the sum is 39.
The spelling of 106676902110 in words is "one hundred six billion, six hundred seventy-six million, nine hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •