16863
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
- 16
- Divisor Sum
- 28416
- Proper Divisor Sum (Aliquot Sum)
- 11553
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- 1
- Radical
- 16863
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 97
- 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
- a(n) = n*(31*n-1)/2.at n=33A022288
- Sums of distinct powers of 7.at n=38A033044
- Positive numbers having the same set of digits in base 2 and base 7.at n=32A037412
- Sums of 3 distinct powers of 7.at n=12A038482
- Composite numbers with four prime factors (not necessarily distinct) whose concatenation yields a palindrome.at n=12A046453
- Number of factorizations with 2 levels of parentheses indexed by prime signatures. A050338(A025487).at n=43A050339
- Row sums in A083175.at n=20A083175
- Numbers n such that n^6 + 272 is prime.at n=22A161998
- a(n) = (2^(n+4)-1)*(2^n+1).at n=5A165133
- Partial sums of A050508.at n=31A178129
- Numbers k whose sum of digits equals the period of 1/k.at n=36A178495
- a(n) = prime(n)*T(n), where T = A000217.at n=20A196421
- Products p*q*r*s of distinct primes for which (p*q*r*s - 1)/2 is prime.at n=34A234498
- Sum of the prime parts in the partitions of n into 9 parts.at n=33A309470
- Numbers n for which A325565(n) < A325568(n).at n=38A325569
- a(n) = number of near-Wieferich primes with |A| <= 10000 less than 10^n.at n=8A354678
- Partial sums of the ziggurat sequence A347186.at n=41A356351
- Expansion of g.f. A(x) satisfying A(x) = x*(1 + A(x)^2) + x^2*(1 + A(x)^2)^2.at n=12A374563