13574
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22248
- Proper Divisor Sum (Aliquot Sum)
- 8674
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6160
- Möbius Function
- -1
- Radical
- 13574
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- Diagonal sum of left-justified array T given by A027023.at n=26A027037
- Number of 3-unbalanced strings of length n (= 2^n - A027557(n)).at n=14A027558
- Number of ways to split 1, 2, 3, ..., 6n into n arithmetic progressions each with 6 terms.at n=12A104432
- Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k valleys strictly above the x-axis (0<=k<=n-2; n>=2). A hill in a Dyck path is a peak at level 1.at n=58A119011
- Let f(k) = exp(Pi*sqrt(k)); sequence gives numbers k such that ceiling(f(k)) - f(k) < 1/10^3.at n=27A127022
- 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, 0), (0, 1, -1), (0, 1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150938
- Walks of length n on the x-axis using steps {1,0,-1} and visiting no point more than twice.at n=11A212587
- Sphenic numbers k such that none of k-2, k-1, k+1 and k+2 is squarefree.at n=40A362561
- Expansion of (1/x) * Series_Reversion( x * (1-x^3/(1-x))^2 ).at n=13A369011
- a(n) = 4*n^3 + 5*n - 1.at n=14A383854