16184
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
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 36840
- Proper Divisor Sum (Aliquot Sum)
- 20656
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6528
- Möbius Function
- 0
- Radical
- 238
- Omega Function (Ω)
- 6
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 159
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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) = 14*n^2.at n=34A144555
- Triangle read by rows given by [1,1,1,1,1,1,1,1,1,1,...] DELTA [1,1,0,0,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.at n=38A167685
- Triangle read by rows: T(n,k) is the number of indecomposable (connected) permutations of {1,2,...,n} having genus k (see first comment for definition of genus).at n=30A185209
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and no two consecutive zero elements.at n=13A199531
- Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, three, four, six, seven or eight distinct values for every i,j,k<=n.at n=6A211597
- Numbers k such that k^3 + 3*k + 3^k is prime.at n=22A220701
- Erroneous version of A000079.at n=14A221180
- Numbers k such that (482*10^k - 41)/9 is prime.at n=18A291923
- Numbers k, the smallest of at least 4 consecutive numbers x, for which phi(x) <= phi(x+1).at n=48A295865
- Numbers k such that phi(k) < phi(k+1) < phi(k+2) < phi(k+3) where phi is the Euler totient function (A000010).at n=35A327880
- Numbers k such that k and k+1 are both phi-practical numbers (A260653).at n=24A330871
- a(n) = Sum_{k=1..n} phi(gcd(k, n))^3.at n=44A342535
- Numbers k such that 1 is in the transitive closure of the map x -> A353313(x) when starting iterating from x=k.at n=53A353306
- Number of subsets of {1..n} containing n such that some element can be written as a nonnegative linear combination of the others.at n=15A365046
- a(n) is the difference between the sum of the squares and the sum of the cubes for the n first terms of A002760.at n=47A374754
- Number of fixed polyquarcs with n cells.at n=7A392394