16793
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19200
- Proper Divisor Sum (Aliquot Sum)
- 2407
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14388
- Möbius Function
- 1
- Radical
- 16793
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 66
- 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
- a(n) = T(n, n-4), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 4.at n=10A026524
- a(n) = T(n,n-4), T given by A026536. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 4.at n=10A026541
- a(n) = a(n-1)+a(n-2)+3a(n-3), with a(0)=a(1)=a(2)=1.at n=14A099213
- a(n) = (4*n^3 - 9*n^2 + 11*n + 3)/3.at n=24A161707
- n for which A079277(n) + phi(n) < n.at n=17A208815
- Irregular array read by rows. a(n) is the largest element in the primitive Collatz-like 3x-k cycle associated with A226623(n).at n=8A226624
- a(n) = n^5 - 2n.at n=7A242436
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 774", based on the 5-celled von Neumann neighborhood.at n=44A273504
- Irregular triangle read by rows: T(n,m) = number of lattice paths of type {B^H}_R terminating at point (n, m).at n=53A291084
- Number of rooted twice-partitions of n where the composite rooted partition is strict.at n=28A301750
- The total number of fixed points among all partitions of n, when parts are written in nondecreasing order.at n=34A357459
- Numbers k such that (prime(j)-1)^2 + 1 is prime for k <= j <= k + 2.at n=14A376522