Base | Representation |
---|---|
bin | 1100101100011… |
… | …00110001001010 |
3 | 21102100212220000 |
4 | 12112030301022 |
5 | 204224422022 |
6 | 14322143430 |
7 | 2432042241 |
oct | 626146112 |
9 | 242325800 |
10 | 106482762 |
11 | 5511a091 |
12 | 2b7b1b76 |
13 | 190a3469 |
14 | 101db958 |
15 | 95356ac |
hex | 658cc4a |
106482762 has 40 divisors (see below), whose sum is σ = 240869376. Its totient is φ = 35156808.
The previous prime is 106482721. The next prime is 106482763. The reversal of 106482762 is 267284601.
106482762 is a `hidden beast` number, since 1 + 0 + 648 + 2 + 7 + 6 + 2 = 666.
It is a super-2 number, since 2×1064827622 = 22677157206297288, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (106482763) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 14263 + ... + 20405.
Almost surely, 2106482762 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106482762, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120434688).
106482762 is an abundant number, since it is smaller than the sum of its proper divisors (134386614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106482762 is a wasteful number, since it uses less digits than its factorization.
106482762 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6264 (or 6255 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 106482762 is about 10319.0485026479. The cubic root of 106482762 is about 473.9797299456.
The spelling of 106482762 in words is "one hundred six million, four hundred eighty-two thousand, seven hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •