Base | Representation |
---|---|
bin | 1100101101011… |
… | …00011000101100 |
3 | 21102121110112112 |
4 | 12112230120230 |
5 | 204243043033 |
6 | 14325023152 |
7 | 2433121640 |
oct | 626543054 |
9 | 242543475 |
10 | 106612268 |
11 | 551a8414 |
12 | 2b854ab8 |
13 | 1911a3a9 |
14 | 10232c20 |
15 | 955dc48 |
hex | 65ac62c |
106612268 has 48 divisors (see below), whose sum is σ = 234232320. Its totient is φ = 41399424.
The previous prime is 106612241. The next prime is 106612273. The reversal of 106612268 is 862216601.
It is a super-2 number, since 2×1066122682 = 22732351376207648, which contains 22 as substring.
It is an unprimeable number.
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, 7880 + ... + 16592.
It is an arithmetic number, because the mean of its divisors is an integer number (4879840).
Almost surely, 2106612268 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106612268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117116160).
106612268 is an abundant number, since it is smaller than the sum of its proper divisors (127620052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106612268 is a wasteful number, since it uses less digits than its factorization.
106612268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8766 (or 8764 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 32.
The square root of 106612268 is about 10325.3216899039. The cubic root of 106612268 is about 474.1718059507.
Adding to 106612268 its reverse (862216601), we get a palindrome (968828869).
The spelling of 106612268 in words is "one hundred six million, six hundred twelve thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •