16171
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16432
- Proper Divisor Sum (Aliquot Sum)
- 261
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15912
- Möbius Function
- 1
- Radical
- 16171
- 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
- 146
- 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
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 75 ones.at n=0A031843
- First differences are A005563.at n=35A047732
- Squares of 1 and primes, written backwards.at n=32A060998
- Numbers k such that A048138(k) is a prime and sets a new record for such primes.at n=34A064440
- Determinant of M(n), the n X n matrix defined by m(i,i) = 1, m(i,j) = i-j.at n=21A079034
- Numbers n such that n and its reversal are distinct brilliant numbers (A078972).at n=23A097435
- Number of (k+1)-tuples of integers modulo n (x_1,...,x_k,s) such that at least one subset of the x_i sums to s mod n. In other words, n^k times the expected number of distinct subset sums mod n of k integers mod n chosen uniformly at random. Read by antidiagonals, i.e., with entries in the order (n,k)=(1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...at n=39A098966
- Number of partitions of n with rank 3 (the rank of a partition is the largest part minus the number of parts).at n=53A101200
- Theorems from propositional calculus, translated into decimal digits.at n=22A101273
- a(n) = (n^3 - 7*n + 12)/6.at n=45A105163
- Semiprimes whose digit reversal is a nontrivial power.at n=33A108849
- Both n and the reverse of n are brilliant numbers (A078972).at n=37A115655
- Brilliant numbers (A078972) whose digit reversal is a square.at n=11A115668
- Brilliant numbers (A078972) whose digit reversal is a powerful(1) number (A001694).at n=12A115675
- Brilliant numbers (A078972) whose digit reversal is the product of 2 palindromes greater than 1.at n=22A115681
- Semiprimes (A001358) whose digit reversal is a powerful(1) number (A001694).at n=39A115688
- Semiprimes (A001358) whose digit reversal is a square.at n=28A115710
- a(n) = 2^n*Product_{k=1..floor((n-1)/2)} (1 + 2*cos(k*Pi/n)^2 + 4*cos(k*Pi/n)^4).at n=13A152090
- a(n) = 13*n^2 + 7*n + 1.at n=34A168240
- Number of strings of n numbers x(i) in -2..2 with sums of x(i) and of x(i)*x(i+1) both zero.at n=8A183937