15077
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15078
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15076
- Möbius Function
- -1
- Radical
- 15077
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 115
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1761
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 51.at n=21A020390
- Primes that remain prime through 3 iterations of function f(x) = 5x + 4.at n=23A023284
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 15.at n=16A050964
- Primes p from A031924 such that A052180(primepi(p)) = 17.at n=15A052234
- Second term of weak prime quintets: p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2).at n=37A054824
- Numbers k such that 5*2^k + 3 is prime.at n=49A058586
- Numbers k such that 3*2^k + 35 is prime.at n=47A059759
- Numbers k such that 41^k - 40^k is prime.at n=7A062607
- a(1) = 2 then primes in nondecreasing order such that every concatenation is prime.at n=35A089702
- a(n) is least prime p such that 7 is the n-th term in the Euclid-Mullin sequence starting at p, or 0 if no such prime p exists.at n=31A094153
- Value of C in y = x^2 + 5x + C such that y is prime for all x = 0 to 3.at n=35A097434
- a(1) = 932; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=36A105213
- Primes congruent to 37 mod 47.at n=38A142388
- Primes congruent to 25 mod 53.at n=35A142555
- Primes congruent to 32 mod 59.at n=26A142759
- Primes congruent to 10 mod 61.at n=30A142808
- Primes p such that continued fraction of (1 + sqrt(p))/2 has period 15: primes in A146338.at n=29A146360
- Primes of form 4k+1 where k is a Pythagorean prime.at n=38A175600
- Integers k such that 2^(k-1) == 1 (mod k) and 2^(m-1) == 1 (mod m), where m = k*(A000265(k-1) - 1) + 1 and A000265 gives the odd part of its argument.at n=14A187849
- Number of nX6 0..1 arrays with exactly floor(nX6/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=3A222767