Base | Representation |
---|---|
bin | 111001101000… |
… | …001001100101 |
3 | 1001102111102222 |
4 | 321220021211 |
5 | 12331403121 |
6 | 1255442125 |
7 | 242255513 |
oct | 71501145 |
9 | 31374388 |
10 | 15106661 |
11 | 8588949 |
12 | 5086345 |
13 | 318c06b |
14 | 20134b3 |
15 | 14d60ab |
hex | e68265 |
15106661 has 2 divisors, whose sum is σ = 15106662. Its totient is φ = 15106660.
The previous prime is 15106633. The next prime is 15106667. The reversal of 15106661 is 16660151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13432225 + 1674436 = 3665^2 + 1294^2 .
It is an emirp because it is prime and its reverse (16660151) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15106661 is a prime.
It is a super-2 number, since 2×151066612 = 456422413137842, 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 15106661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15106667) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7553330 + 7553331.
It is an arithmetic number, because the mean of its divisors is an integer number (7553331).
Almost surely, 215106661 is an apocalyptic number.
It is an amenable number.
15106661 is a deficient number, since it is larger than the sum of its proper divisors (1).
15106661 is an equidigital number, since it uses as much as digits as its factorization.
15106661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 26.
The square root of 15106661 is about 3886.7288302633. The cubic root of 15106661 is about 247.2043798950.
The spelling of 15106661 in words is "fifteen million, one hundred six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •