16933
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 3227
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13920
- Möbius Function
- -1
- Radical
- 16933
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 203
- 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
- no
- Odd
- yes
Appears in sequences
- Number of bipartite partitions of n white objects and 4 black ones.at n=16A000465
- Numerators of continued fraction convergents to sqrt(941).at n=5A042820
- Prime factorization of n encoded by interleaving successive prime exponents in unary to bit-positions given by columns of A001477.at n=31A075175
- a(n) = Sum_{d|n} A007955(d) * A000027(d) = Sum_{d|n} A007955(d) * (d), where A007955(m) = product of divisors of m.at n=15A174933
- The Collatz (3x+1) iteration in A220145 converted to decimal.at n=10A221468
- a(n) = Sum_{k=1..n} 2^(T(k)-1), where T(k)=k(k+1)/2 = A000217(k).at n=5A246534
- Numbers k such that k!6 + 18 is prime, where k!6 is the sextuple factorial number (A085158 ).at n=33A288445
- Numbers k such that the k-th composition in standard order is a permutation (of an initial interval).at n=34A333218
- a(n) = Sum_{k=1..n} (A000330(n) mod k^2).at n=43A344711
- Numbers k such that the k-th composition in standard order is a non-alternating permutation of an initial interval of positive integers.at n=16A350250
- Number of ways to write n as an ordered sum of seven positive Fibonacci numbers (with a single type of 1).at n=35A357694