16413
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21888
- Proper Divisor Sum (Aliquot Sum)
- 5475
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10940
- Möbius Function
- 1
- Radical
- 16413
- 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
- 159
- 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
- Expansion of (2-2*x-x^2)/((1-2*x^2)*(1-x)^2).at n=28A016724
- Numbers whose base-4 representation contains exactly four 0's and three 1's.at n=18A045036
- 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, -1), (0, 0, 1), (0, 1, 0), (1, 0, 1)}.at n=8A151030
- The ED3 array read by antidiagonals.at n=15A167572
- The first column of the ED3 array A167572.at n=5A167576
- A triangle related to the GF(z) formulas of the rows of the ED3 array A167572.at n=20A167583
- Sums of three Mersenne primes.at n=32A174055
- a(n) = 2^n + 2*n + 1.at n=14A176691
- Expansion of 1/((1-x)^2*(1-2*x+2*x^2)).at n=26A279230
- Number of twice-partitions of n into odd-length partitions.at n=18A358334
- Expansion of Sum_{k>0} k * x^k / (1 - 2*x^(2*k)).at n=28A364035
- Degeneracy of the n-Mycielski graph.at n=22A380327