12956
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23520
- Proper Divisor Sum (Aliquot Sum)
- 10564
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6240
- Möbius Function
- 0
- Radical
- 6478
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- no
- Squarefree Number
- no
- 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(n) = a(n-1) + Sum_{k=0..n/3} a(n-3k) with a(0)=1.at n=23A113435
- Third row of A113435.at n=7A113438
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 0, 1), (1, -1, 0), (1, 1, -1), (1, 1, 0)}.at n=8A149377
- Long legs of primitive Pythagorean triples (a,b,c) for which 2a+1, 2b+1 and 2c+1 are primes.at n=34A165237
- a(n) = 11*a(n-2) - 8*a(n-4), starting a(0)=0, a(1)=1, a(2)=5, a(3)=12.at n=9A179994
- Number of 2-step one or two space at a time rook's tours on an n X n board summed over all starting positions.at n=40A187287
- Number of n X n symmetric binary matrices with each 1 adjacent to no more than 3 knight-move neighboring 1s.at n=4A191571
- Number of length n+5 0..1 arrays with every six consecutive terms having the maximum of some two terms equal to the minimum of the remaining four terms.at n=10A250074
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 517", based on the 5-celled von Neumann neighborhood.at n=23A272732
- Number of 2 X n 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 0 or 2 neighboring 1s.at n=9A297339
- Least common multiple of prime(n+1)+1 and prime(n)+1.at n=36A309772
- Numbers k such that k and k+1 are both hoax numbers (A019506).at n=23A329935
- Number of vertices among all distinct circles that can be constructed from a 2 x n square grid of points using only a compass.at n=7A359859