12502
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 10538
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4968
- Möbius Function
- 1
- Radical
- 12502
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 112
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(0) = 1, a(n) = 20*n^2 + 2 for n>0.at n=25A010010
- Starting from generation 8 add previous and next term yielding generation 9.at n=14A048455
- First differences of A087404: a(n) = A087404(n) - A087404(n-1), a(0) = A087404(0).at n=6A087405
- 75-gonal numbers: a(n) = n*(73*n-71)/2.at n=19A098230
- Triangle read by rows: numbers of isomers of unbranched a-4-catapolyoctagons.at n=37A120649
- Numbers of isomers of unbranched a-4-catapolyoctagons - see Brunvoll reference for precise definition.at n=7A121145
- Triangle where g.f. of row n = Product_{i=0..n} [F(i+1) + F(i)*x] for n>=0, where F(i) = A000045(i) is the i-th Fibonacci number.at n=22A130405
- Column 1 of triangle A130405.at n=5A130406
- Multiples of 19 whose digit reversal - 1 is also a multiple of 19.at n=29A166399
- Numbers divisible by the sum of 4th powers of their digits.at n=36A169665
- Number of distinct solutions of sum{i=1..9}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1.at n=3A180801
- [s(k)-s(j)]/6, where the pairs (k,j) are given by A205857 and A205858, and s(k) denotes the (k+1)-st Fibonacci number.at n=39A205860
- a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 1] as of [1, 2, 2].at n=9A211284
- The Berndt-type sequence number 9 for the argument 2*Pi/13.at n=5A211988
- Number of 3 X 3 X 3 triangular 0..n arrays with every horizontal row nondecreasing and having the same average value.at n=25A214907
- Number of n-step walks (each step +-1 starting from 0) which are never more than 5 or less than -5.at n=14A216241
- Sum of column entries of the table with rows of prime numbers (2,3,0,0,...), (0,5,7,11,0,...), (0,0,13,17,19,23,0,...), (0,0,0,29,31,37,41,43,0,...), ...at n=22A238760
- Expansion of (4 + 15*x - 35*x^2 + 20*x^3 - 2*x^5)/(1 - x)^5.at n=15A257600
- a(n) = (n^4 + 20*n^3 + 125*n^2 + 250*n + 24)/12.at n=15A257601
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 14", based on the 5-celled von Neumann neighborhood.at n=34A269709