Base | Representation |
---|---|
bin | 1100101101110… |
… | …01100110111001 |
3 | 21102201012211100 |
4 | 12112321212321 |
5 | 204301311200 |
6 | 14330122013 |
7 | 2433435555 |
oct | 626714671 |
9 | 242635740 |
10 | 106666425 |
11 | 55235078 |
12 | 2b880309 |
13 | 19138c38 |
14 | 10248865 |
15 | 956ed00 |
hex | 65b99b9 |
106666425 has 18 divisors (see below), whose sum is σ = 191051822. Its totient is φ = 56888640.
The previous prime is 106666421. The next prime is 106666451. The reversal of 106666425 is 524666601.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 34433424 + 72233001 = 5868^2 + 8499^2 .
It is not a de Polignac number, because 106666425 - 22 = 106666421 is a prime.
It is a super-2 number, since 2×1066664252 = 22755452444561250, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 106666425.
It is not an unprimeable number, because it can be changed into a prime (106666421) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 236812 + ... + 237261.
Almost surely, 2106666425 is an apocalyptic number.
106666425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106666425 is a deficient number, since it is larger than the sum of its proper divisors (84385397).
106666425 is a wasteful number, since it uses less digits than its factorization.
106666425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 474089 (or 474081 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The square root of 106666425 is about 10327.9438902426. The cubic root of 106666425 is about 474.2520824390.
The spelling of 106666425 in words is "one hundred six million, six hundred sixty-six thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •