12444
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 31248
- Proper Divisor Sum (Aliquot Sum)
- 18804
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 6222
- Omega Function (Ω)
- 5
- 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
- 37
- 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
- Numbers k such that sigma(k) = sigma(k+6).at n=30A015866
- Non-palindromic number and its reversal are both multiples of 17.at n=29A062915
- Subdiagonal of array of n-gonal numbers A081422.at n=23A081423
- 47-gonal numbers.at n=23A095311
- a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, for n>3: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4)], where SORT places digits in ascending order and deletes 0's.at n=26A108565
- 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, 1, 0), (1, 0, 1), (1, 1, -1), (1, 1, 0)}.at n=7A150788
- Numbers k such that k![7]-1 is prime (where k![7] = A114799(k) = septuple factorial).at n=54A156167
- Number of simple labeled graphs on n+2 nodes with exactly n connected components that are trees or cycles.at n=16A215862
- Number of n X 3 binary arrays with top left element equal to 1 and no two ones adjacent horizontally or nw-se.at n=6A228791
- T(n,k)=Number of nXk binary arrays with top left element equal to 1 and no two ones adjacent horizontally or nw-se.at n=42A228796
- Number of 7Xn binary arrays with top left element equal to 1 and no two ones adjacent horizontally or nw-se.at n=2A228802
- a(n) = n*(n+1)*(n+2)*(n^2+2*n+17)/120.at n=15A257199
- Expansion of b(2)*b(4)*b(6)/(x^8-x^4-x+1), where b(k) = (1-x^k)/(1-x).at n=26A265055
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 205", based on the 5-celled von Neumann neighborhood.at n=26A270731
- Erroneous version of A129860.at n=17A274942
- Expansion of x*(1 - 2*x + x^2 + 7*x^3 - x^4)/((1 - x)^4*(1 + x)^3).at n=47A292551
- a(n) = prime(n)*prime(n+1) + prime(n+2).at n=28A292926
- Positions of -2's in A346242.at n=41A354822
- Number of regions formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the square.at n=10A355798
- Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes when each pair of points is connected by a circle and where the points lie at the ends of the circles' diameter.at n=29A362236