Base | Representation |
---|---|
bin | 1100101100001… |
… | …10000001011100 |
3 | 21102022110222200 |
4 | 12112012001130 |
5 | 204223031012 |
6 | 14321411500 |
7 | 2431565550 |
oct | 626060134 |
9 | 242273880 |
10 | 106455132 |
11 | 55100353 |
12 | 2b799b90 |
13 | 19093a04 |
14 | 101d1860 |
15 | 952c3dc |
hex | 658605c |
106455132 has 72 divisors (see below), whose sum is σ = 320925696. Its totient is φ = 29091744.
The previous prime is 106455131. The next prime is 106455149. The reversal of 106455132 is 231554601.
106455132 is a `hidden beast` number, since 1 + 0 + 645 + 5 + 13 + 2 = 666.
It is a super-2 number, since 2×1064551322 = 22665390258274848, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106455096 and 106455105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106455131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3388 + ... + 14979.
Almost surely, 2106455132 is an apocalyptic number.
106455132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106455132 is an abundant number, since it is smaller than the sum of its proper divisors (214470564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106455132 is a wasteful number, since it uses less digits than its factorization.
106455132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18407 (or 18402 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 106455132 is about 10317.7096295641. The cubic root of 106455132 is about 473.9387305307.
The spelling of 106455132 in words is "one hundred six million, four hundred fifty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •