13468
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 29792
- Proper Divisor Sum (Aliquot Sum)
- 16324
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5184
- Möbius Function
- 0
- Radical
- 6734
- 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
- 89
- 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
- Arrange digits of 2^n in ascending order.at n=14A028909
- Number of necklaces with 6 black beads and n-6 white beads.at n=22A032191
- Theta series of A2[hole]^4.at n=33A033690
- Numbers n such that sigma(2n+1)=3n.at n=6A067684
- Suppose the integer m has k decimal digits; make a list of the k! strings obtained by permuting the digits in all possible ways; discard any leading zeros; count distinct squares in the list (A062892); a(n) = smallest m that yields n squares.at n=4A068805
- Trisection of A007294.at n=36A073471
- Sum of terms in periodic part of continued fraction expansion of square root of -1 + 3^n.at n=14A077631
- Least k such that decimal representation of k*n contains only digits 0 and 4.at n=32A096683
- Sixth column of (1,5)-Pascal triangle A096940.at n=12A096943
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k valleys.at n=30A101282
- Let S(1)={1} and, for n>1 let S(n) be the smallest set containing x, x+1, 2x and 3x for each element x in S(n-1). a(n) is the number of elements in S(n).at n=13A123247
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n having k DL's (n>=0; 0<=k<=floor(n/2)).at n=27A128731
- Concatenation of first n numbers of the lower Wythoff sequence.at n=4A132935
- a(n) = 4*(4^n-3^n).at n=6A145544
- 4 times heptagonal numbers: a(n) = 2*n*(5*n-3).at n=37A153784
- Numbers k which are concatenations k=x//y such that x^2 + y^2 - x*y = k.at n=29A162556
- Numbers m such that m^2 + 3^k is prime for k = 1, 2, 3.at n=22A177173
- Number of 4-step E, S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=16A187587
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and no two or three adjacent elements summing to zero.at n=13A200431
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 2.at n=30A209984