13398
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 34560
- Proper Divisor Sum (Aliquot Sum)
- 21162
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- -1
- Radical
- 13398
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 138
- 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
- Number of partitions of n that do not contain 2 as a part.at n=41A027336
- A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives x's for indecomposable Wallis pairs with x < y (ordered by values of x).at n=29A075768
- Consider recurrence b(0) = (2n+1)/2, b(n) = b(n-1)*ceiling(b(n-1)); sequence gives first integer reached.at n=9A081853
- a(n) = (8*n - 3)*(4*n - 1)*(8*n^2 - 5*n + 1).at n=3A081854
- a(n) = n for n <= 2; for n > 2, a(n) = 2a(n-1) - a(n - floor(1/2 + sqrt(2(n-1)))).at n=18A096824
- Numbers k such that the central binomial coefficient C(2k,k) is divisible by k^2.at n=27A121943
- Composites one larger than a prime, with exactly five distinct prime factors.at n=23A136154
- Numbers k such that both k and k^2/2 are averages of twin prime pairs.at n=17A152787
- Averages of twin prime pairs of A074378.at n=10A154563
- a(n) = 16*n^2 - 2*n.at n=28A158058
- Number of different deltoids (including squares) whose vertices are on an n X n grid.at n=33A159944
- a(0)=0: a(n)=A002865(2*n)+A002865(2*n+1), n>=1.at n=20A182844
- Number of (n+1)X3 0..1 arrays with rows and columns of permanents of all 2X2 subblocks lexicographically nondecreasing, and all 2X2 permanents nonzero.at n=7A204734
- T(n,k) is the number of (n+1) X (k+1) 0..1 arrays with rows and columns of permanents of all 2X2 subblocks lexicographically nondecreasing, and all 2 X 2 permanents nonzero.at n=37A204740
- T(n,k) is the number of (n+1) X (k+1) 0..1 arrays with rows and columns of permanents of all 2X2 subblocks lexicographically nondecreasing, and all 2 X 2 permanents nonzero.at n=43A204740
- Number of (w,x,y,z) with all terms in {1,...,n} and w+|x-y|<=|x-z|+|y-z|.at n=29A212691
- Squarefree nonprimes n with a divisor d such that phi(n) divides n+d.at n=25A217741
- Number of (n+2) X (2+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=8A252805
- Partial sums of A140091.at n=28A267370
- Numbers k such that 4*10^k + 21 is prime.at n=24A276047