13449
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17936
- Proper Divisor Sum (Aliquot Sum)
- 4487
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8964
- Möbius Function
- 1
- Radical
- 13449
- Omega Function (Ω)
- 2
- 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
- 226
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that k and 7*k are anagrams.at n=7A023091
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=29A031830
- Numerators of continued fraction convergents to sqrt(269).at n=5A041504
- Third row of Pascal-(1,3,1) array A081578.at n=41A081585
- Semiprimes of the form 2*n + 1, where n is a square.at n=35A111351
- a(n) = 1250*n^2 - 1800*n + 649.at n=4A154358
- a(n) = (prime(n) - 1)*(prime(n+1) - 1)/2 + 3.at n=37A201498
- Principal diagonal of the convolution array A213781.at n=32A213782
- Numbers n such that 8^n + 3 is prime.at n=25A217354
- Numbers x whose digits can be permuted to produce a multiple of x.at n=20A245680
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=20A250812
- Number of (6+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=0A250818
- Numbers k dividing every cyclic permutation of k^k.at n=48A262814
- Numbers k such that the decimal number concat(4,k) is a square.at n=32A273359
- Number T(n,k) of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=67A288387
- Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals one.at n=10A288540