16143
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
- 21528
- Proper Divisor Sum (Aliquot Sum)
- 5385
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10760
- Möbius Function
- 1
- Radical
- 16143
- 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
- 71
- 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) is the number of hierarchical models on n unlabeled factors or variables with linear terms forced.at n=6A006602
- Second partial sums of A001891.at n=12A053809
- Start of the first run of exactly n consecutive odd composite numbers.at n=19A075067
- A Langford-like sequence.at n=39A108401
- Integers i such that 9*i = 25 X i, but 17*i is not 49 X i.at n=25A115811
- The least semiprime (A001358) such that between it and the next n semiprimes, but not the next n+1 semiprimes, there are no primes.at n=13A228170
- Quotients connected with the Banach matchboxes problem: Sum_{i=1..prime(n)-5} 2^(i-1)*binomial(i+1,2)/prime(n) (case 2).at n=4A238693
- Number of steps to reach 0 when starting from (2^n)-1 and iterating the map x -> x - (number of runs in binary representation of x): a(n) = A255072(A000225(n)).at n=17A255062
- The Matula number of the rooted tree obtained from the rooted tree T having Matula number n by replacing each edge of T with a path of length 2.at n=21A257538
- Number of unlabeled simplicial complexes with n nodes.at n=6A261005
- a(n) = (2^n-1)^2 + 2*n.at n=6A286191
- G.f. A(x) satisfies: A(x) = Product_{k>=1} 1/(1 - x^k*A(x))^k.at n=8A302171
- Odd numbers k such that the multiplicative orders of 2 modulo k and modulo k+2 are equal.at n=42A333743
- Starts of runs of 4 consecutive Gray-code Niven numbers (A344341).at n=24A344344
- Starts of runs of at least 3 consecutive odd numbers whose prime factors are all prime-indexed primes.at n=21A357168
- Expansion of g.f. A(x) satisfying A(x) = A( x^2*(1+x)^3 ) / (x*(1+x)^2).at n=13A369546