Base | Representation |
---|---|
bin | 1100101100000… |
… | …11101100100001 |
3 | 21102021222220200 |
4 | 12112003230201 |
5 | 204222224401 |
6 | 14321255413 |
7 | 2431526013 |
oct | 626035441 |
9 | 242258820 |
10 | 106445601 |
11 | 550a4179 |
12 | 2b794569 |
13 | 1908c582 |
14 | 101cc1b3 |
15 | 9529686 |
hex | 6583b21 |
106445601 has 12 divisors (see below), whose sum is σ = 154537812. Its totient is φ = 70602336.
The previous prime is 106445579. The next prime is 106445609. The reversal of 106445601 is 106544601.
106445601 is a `hidden beast` number, since 10 + 6 + 4 + 45 + 601 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 97535376 + 8910225 = 9876^2 + 2985^2 .
It is a de Polignac number, because none of the positive numbers 2k-106445601 is a prime.
It is a super-2 number, since 2×1064456012 = 22661331944502402, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106445609) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28246 + ... + 31791.
It is an arithmetic number, because the mean of its divisors is an integer number (12878151).
Almost surely, 2106445601 is an apocalyptic number.
It is an amenable number.
106445601 is a deficient number, since it is larger than the sum of its proper divisors (48092211).
106445601 is a wasteful number, since it uses less digits than its factorization.
106445601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60240 (or 60237 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 106445601 is about 10317.2477434634. The cubic root of 106445601 is about 473.9245860901.
It can be divided in two parts, 1064 and 45601, that added together give a triangular number (46665 = T305).
The spelling of 106445601 in words is "one hundred six million, four hundred forty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •