12515
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15024
- Proper Divisor Sum (Aliquot Sum)
- 2509
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10008
- Möbius Function
- 1
- Radical
- 12515
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 125
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Concatenation of first n Bell numbers (starting with A000110(1)).at n=3A061114
- Number of consecutive prime runs of 1 prime congruent to 3 mod 4 below 10^n.at n=5A092637
- Sum of parts, counted without multiplicities, in all partitions of n into odd parts.at n=34A116930
- Numbers k such that binomial(4k, k) + 1 is prime.at n=29A125241
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 5 and 6.at n=42A136974
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 5 and 6.at n=51A136988
- Numbers k such that k and k^2 use only the digits 1, 2, 5 and 6.at n=14A137003
- Numbers k such that k and k^2 use only the digits 1, 2, 5, 6 and 7.at n=36A137004
- Numbers k such that k and k^2 use only the digits 1, 2, 5, 6 and 8.at n=24A137005
- Numbers k such that k and k^2 use only the digits 1, 2, 5, 6 and 9.at n=22A137006
- Position of 5^n in A051037 (5-smooth numbers).at n=27A188427
- Number of n X 4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,2,4,0,3 for x=0,1,2,3,4.at n=6A196597
- Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,2,4,0,3 for x=0,1,2,3,4.at n=3A196600
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,2,4,0,3 for x=0,1,2,3,4.at n=48A196601
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,2,4,0,3 for x=0,1,2,3,4.at n=51A196601
- Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,3,4,0,2 for x=0,1,2,3,4.at n=3A196645
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,3,4,0,2 for x=0,1,2,3,4.at n=48A196646
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,3,4,0,2 for x=0,1,2,3,4.at n=51A196646
- Number of partitions p of n such that the number of parts having multiplicity 1 is a part or max(p) - min(p) is a part.at n=36A241451
- Partial sums of A252750: a(0) = 0; for >= 1: a(n) = A252750(n) + a(n-1).at n=61A252751