Base | Representation |
---|---|
bin | 1100101100010… |
… | …10111000001110 |
3 | 21102100111021100 |
4 | 12112022320032 |
5 | 204224200042 |
6 | 14322043530 |
7 | 2432010543 |
oct | 626127016 |
9 | 242314240 |
10 | 106475022 |
11 | 55114295 |
12 | 2b7a95a6 |
13 | 1909ca94 |
14 | 101d8bca |
15 | 953324c |
hex | 658ae0e |
106475022 has 48 divisors (see below), whose sum is σ = 237699072. Its totient is φ = 34428240.
The previous prime is 106475021. The next prime is 106475077. The reversal of 106475022 is 220574601.
106475022 is a `hidden beast` number, since 10 + 647 + 5 + 0 + 2 + 2 = 666.
It is a super-2 number, since 2×1064750222 = 22673860619800968, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106475021) 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 23 ways as a sum of consecutive naturals, for example, 106947 + ... + 107937.
It is an arithmetic number, because the mean of its divisors is an integer number (4952064).
Almost surely, 2106475022 is an apocalyptic number.
106475022 is an abundant number, since it is smaller than the sum of its proper divisors (131224050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106475022 is a wasteful number, since it uses less digits than its factorization.
106475022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1173 (or 1170 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 106475022 is about 10318.6734612546. The cubic root of 106475022 is about 473.9682454826.
The spelling of 106475022 in words is "one hundred six million, four hundred seventy-five thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •