Base | Representation |
---|---|
bin | 1100101011110… |
… | …10001011100111 |
3 | 21102020000110100 |
4 | 12111322023213 |
5 | 204220003011 |
6 | 14320355143 |
7 | 2431304262 |
oct | 625721347 |
9 | 242200410 |
10 | 106406631 |
11 | 55077971 |
12 | 2b775ab3 |
13 | 19077906 |
14 | 101bbcd9 |
15 | 951cd56 |
hex | 657a2e7 |
106406631 has 36 divisors (see below), whose sum is σ = 166084360. Its totient is φ = 65448000.
The previous prime is 106406627. The next prime is 106406647. The reversal of 106406631 is 136604601.
106406631 is a `hidden beast` number, since 10 + 640 + 6 + 6 + 3 + 1 = 666.
It is not a de Polignac number, because 106406631 - 22 = 106406627 is a prime.
It is a super-2 number, since 2×1064066312 = 22644742241540322, which contains 22 as substring.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106406595 and 106406604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106406431) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1053481 + ... + 1053581.
Almost surely, 2106406631 is an apocalyptic number.
106406631 is a deficient number, since it is larger than the sum of its proper divisors (59677729).
106406631 is a wasteful number, since it uses less digits than its factorization.
106406631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 288 (or 184 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 106406631 is about 10315.3589855128. The cubic root of 106406631 is about 473.8667440399.
It can be divided in two parts, 10640 and 6631, that added together give a palindrome (17271).
The spelling of 106406631 in words is "one hundred six million, four hundred six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •