15199
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15200
- 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
- 15198
- Möbius Function
- -1
- Radical
- 15199
- 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
- 58
- 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
- 1775
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that 6!*(2*k-7)!/(k!*(k-1)!) is an integer.at n=15A004786
- Numbers k such that 7!*(2k-8)!/(k!*(k-1)!) is an integer.at n=17A004787
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 68 ones.at n=21A031836
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^3.at n=8A070903
- Number of elements e in all partitions of n such that e divides n.at n=26A089251
- Group the natural numbers so that the n-th group contains n numbers whose sum as well as the group product +1 is prime. Sequence contains the primes arising as the sum of the terms of groups.at n=30A092946
- Primes p = p_(n+1) such that p_n + p_(n+2) = 2*p_(n+1) + 12.at n=12A095673
- Primes of the form 2*3*5*7*n+79.at n=35A141563
- Primes congruent to 18 mod 47.at n=38A142369
- Primes congruent to 41 mod 53.at n=35A142571
- Primes congruent to 36 mod 59.at n=28A142763
- Primes congruent to 10 mod 61.at n=31A142808
- a(n) = 400*n - 1.at n=37A158317
- a(n) = 38*n^2 - 1.at n=19A158596
- G.f. satisfies: A(x) = (1 + x*(1-x)*A(x)) * (1 + x^2*A(x)^2).at n=12A216616
- First prime p such that (p+n)^2+n is prime but (p+j)^2+j is not prime for all 0<j<n.at n=25A238673
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 609", based on the 5-celled von Neumann neighborhood.at n=24A273210
- Number of nX6 0..1 arrays with every element equal to 0, 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=2A301839
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=30A301841
- Number of 3Xn 0..1 arrays with every element equal to 0, 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=5A301843