Base | Representation |
---|---|
bin | 1100101010110… |
… | …00000101111101 |
3 | 21101221220221000 |
4 | 12111120011331 |
5 | 204201021010 |
6 | 14313400513 |
7 | 2430153225 |
oct | 625300575 |
9 | 241856830 |
10 | 106267005 |
11 | 54a91a79 |
12 | 2b709139 |
13 | 190291b0 |
14 | 10183085 |
15 | 94e17c0 |
hex | 655817d |
106267005 has 64 divisors (see below), whose sum is σ = 205309440. Its totient is φ = 51840000.
The previous prime is 106267001. The next prime is 106267013. The reversal of 106267005 is 500762601.
It is not a de Polignac number, because 106267005 - 22 = 106267001 is a prime.
It is a super-2 number, since 2×1062670052 = 22585352703340050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 106267005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106267001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 264805 + ... + 265205.
It is an arithmetic number, because the mean of its divisors is an integer number (3207960).
Almost surely, 2106267005 is an apocalyptic number.
106267005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106267005 is a deficient number, since it is larger than the sum of its proper divisors (99042435).
106267005 is a wasteful number, since it uses less digits than its factorization.
106267005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 579 (or 573 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 106267005 is about 10308.5888947033. The cubic root of 106267005 is about 473.6593851609.
The spelling of 106267005 in words is "one hundred six million, two hundred sixty-seven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •