12448
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24570
- Proper Divisor Sum (Aliquot Sum)
- 12122
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6208
- Möbius Function
- 0
- Radical
- 778
- Omega Function (Ω)
- 6
- 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
- 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 the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 55.at n=30A031553
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^3.at n=8A071971
- CATS sequence: cube-add-then-sort variation of RATS (reverse, add then sort) sequence.at n=27A079320
- Total length of longest runs of 1's in all bitstrings of length n.at n=11A119706
- a(0)=1; thereafter a(n)=a(n-1)+a([n/Phi]), where Phi=(1+sqrt(5))/2, the golden ratio.at n=39A131882
- Triangle T(n,k) = Sum_{j=0..k} Stirling1(n, n-j)*binomial(n,j) + Sum_{j=0..n-k} Stirling1(n, n-j)*binomial(n,j), read by rows.at n=31A176154
- Triangle T(n,k) = Sum_{j=0..k} Stirling1(n, n-j)*binomial(n,j) + Sum_{j=0..n-k} Stirling1(n, n-j)*binomial(n,j), read by rows.at n=32A176154
- Half the number of nXnXn triangular binary arrays with every element equal to at most 4 neighbors.at n=4A192486
- Number of symmetric and correlation-immune Boolean functions of n variables.at n=21A210571
- Number of (w,x,y,z) with all terms in {1,...,n} and w <= (geometric mean of x,y,z).at n=13A212143
- Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape U; triangle T(n,k), n>=0, read by rows.at n=19A247708
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 133", based on the 5-celled von Neumann neighborhood.at n=26A270234
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 878", based on the 5-celled von Neumann neighborhood.at n=31A273741
- Number of equivalence classes under the fixed-point-free braid relation B_{FPF}(w_0).at n=4A278589
- Triangle read by rows, T(n, k) = 2^k*binomial(n, k)*hypergeom([-k, k - n, k - n], [1, -n], 1/2) for n >= 0 and 0 <= k <= n.at n=52A299444
- E.g.f. C(x,y) = cos(y) / sqrt(1 - sin(x)^2 - sin(y)^2).at n=18A324609
- E.g.f. C(y,x) = cos(x) / sqrt(1 - sin(x)^2 - sin(y)^2).at n=17A324611
- Number of rooted regular combinatorial maps with n edges.at n=6A380625