13598
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22008
- Proper Divisor Sum (Aliquot Sum)
- 8410
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6264
- Möbius Function
- -1
- Radical
- 13598
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 120
- 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
- a(n) = floor(log(5)^n).at n=20A014216
- "BFK" (reversible, size, unlabeled) transform of 2,2,2,2...at n=19A032043
- Global ranks of terms of A057122: tells which terms of A014486 form rooted plane binary trees also when interpreted as codes for ordinary rooted planar trees.at n=41A057123
- Self-locating strings within Pi: numbers n such that the string n is at position n in the decimal digits of Pi, where 1 is the 0th digit.at n=2A064810
- Expansion of (sqrt(1+2x) + sqrt(1-2x))/(2*(1-2x)^(3/2)).at n=12A099325
- Number of ways to place 2 nonattacking knights on an n X n cylindrical board.at n=12A172964
- Fibonacci-type sequence based on bitwise exclusive-or: a(0) = 0, a(1) = 1 and a(n) = a(n-1) + (a(n-1) xor a(n-2)).at n=14A182201
- Number of (n+1)X(7+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=2A250796
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=38A250797
- Number of (3+1) X (n+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=6A250800
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 324", based on the 5-celled von Neumann neighborhood.at n=39A271257
- Numbers k such that A101337(k)/k is an integer.at n=17A306360
- Number of 7-element subsets of [n] whose sum is a triangular number.at n=15A320853
- Least number m > 0 such that A101337(m)/m = n, or 0 if no such m exists.at n=6A329292
- Largest number m > 0 such that A101337(m)/m = n, or 0 if no such m exists.at n=6A329659
- Number of simple unlabeled non-null graphs on <= n nodes.at n=7A353213