12974
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
- 8
- Divisor Sum
- 21000
- Proper Divisor Sum (Aliquot Sum)
- 8026
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5976
- Möbius Function
- -1
- Radical
- 12974
- Omega Function (Ω)
- 3
- 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
- 50
- 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(1)=1. For m >= 0 and 1 <= k <= 2^m, a(2^m +k) = a(k) + Sum_{j=1..2^m} a(j).at n=37A139485
- 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, -1, 1), (-1, 0, 0), (1, -1, 1), (1, 1, -1), (1, 1, 0)}.at n=8A149299
- Integers whose binary digits "1" define, if sorted into a quadrant shape whose right angle lies in a Go board corner, same colored Go stones that surely live all, but not if any stone is omitted.at n=20A166537
- Integers of the form: 0/3 + 1/3 + 2/3 + 3/3 + 5/3 + 7/3 + 11/3 + 13/3 + 17/3 + ....at n=44A182155
- Equals one maps: number of n X 2 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..2 n X 2 array.at n=6A220806
- T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..2 nXk array.at n=29A220810
- T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..2 nXk array.at n=34A220810
- T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..3 nXk array.at n=29A221024
- T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..3 nXk array.at n=34A221024
- Numbers k such that k and k+1 have the same binary XOR of divisors.at n=27A227443
- Number of set partitions of [n] into exactly five parts such that no part contains two elements with a circular distance less than three.at n=8A261481
- Number of surviving even nodes at generation n in the binary tree of persistently squarefree numbers (see A293230).at n=34A293518
- Expansion of Product_{k=1..9} (1+x^(2*k-1))/(1-x^(2*k)).at n=49A316721
- Numbers k such that 429*2^k+1 is prime.at n=36A323115
- Sum of the second largest parts of the partitions of n into 10 squarefree parts.at n=46A326636
- Forward difference of difference between 2^n and the next smaller power of 3.at n=17A328334
- Numbers k for which A354102(k) = A354102(sigma(k)).at n=14A354106
- G.f. A(x) satisfies A(x) = 1 + x / ((1+x)^(5/2)*A(x)^(3/2)).at n=7A366498