Base | Representation |
---|---|
bin | 1100101101011… |
… | …11100110111010 |
3 | 21102122010122100 |
4 | 12112233212322 |
5 | 204244003331 |
6 | 14325204230 |
7 | 2433205263 |
oct | 626574672 |
9 | 242563570 |
10 | 106625466 |
11 | 55207322 |
12 | 2b860676 |
13 | 191233bc |
14 | 1023796a |
15 | 9562ae6 |
hex | 65af9ba |
106625466 has 48 divisors (see below), whose sum is σ = 237672864. Its totient is φ = 34528032.
The previous prime is 106625459. The next prime is 106625483. The reversal of 106625466 is 664526601.
It is a happy number.
106625466 is a `hidden beast` number, since 106 + 6 + 2 + 546 + 6 = 666.
It is a super-2 number, since 2×1066254662 = 22737979999434312, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106625466.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 268380 + ... + 268776.
It is an arithmetic number, because the mean of its divisors is an integer number (4951518).
Almost surely, 2106625466 is an apocalyptic number.
106625466 is an abundant number, since it is smaller than the sum of its proper divisors (131047398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106625466 is a wasteful number, since it uses less digits than its factorization.
106625466 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 795 (or 792 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The square root of 106625466 is about 10325.9607785426. The cubic root of 106625466 is about 474.1913717455.
It can be divided in two parts, 10 and 6625466, that added together give a square (6625476 = 25742).
The spelling of 106625466 in words is "one hundred six million, six hundred twenty-five thousand, four hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •