Base | Representation |
---|---|
bin | 1100101001010… |
… | …10101100101100 |
3 | 21101121110212110 |
4 | 12110222230230 |
5 | 204124043233 |
6 | 14305404020 |
7 | 2425450152 |
oct | 624525454 |
9 | 241543773 |
10 | 106081068 |
11 | 54975305 |
12 | 2b639610 |
13 | 18c92682 |
14 | 101353d2 |
15 | 94a6663 |
hex | 652ab2c |
106081068 has 48 divisors (see below), whose sum is σ = 254951424. Its totient is φ = 34312320.
The previous prime is 106081067. The next prime is 106081069. The reversal of 106081068 is 860180601.
It is an interprime number because it is at equal distance from previous prime (106081067) and next prime (106081069).
It is a super-2 number, since 2×1060810682 = 22506385976041248, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106081061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70888 + ... + 72368.
It is an arithmetic number, because the mean of its divisors is an integer number (5311488).
Almost surely, 2106081068 is an apocalyptic number.
It is an amenable number.
106081068 is an abundant number, since it is smaller than the sum of its proper divisors (148870356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106081068 is a wasteful number, since it uses less digits than its factorization.
106081068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1662 (or 1660 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 30.
The square root of 106081068 is about 10299.5663986403. The cubic root of 106081068 is about 473.3829675298.
It can be divided in two parts, 1060 and 81068, that added together give a palindrome (82128).
The spelling of 106081068 in words is "one hundred six million, eighty-one thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •