16297
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16720
- Proper Divisor Sum (Aliquot Sum)
- 423
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15876
- Möbius Function
- 1
- Radical
- 16297
- 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
- 97
- 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
- Pseudoprimes to base 5.at n=29A005936
- Pseudoprimes to base 39.at n=31A020167
- Strong pseudoprimes to base 25.at n=15A020251
- a(n) = (d(n)-r(n))/2, where d = A026063 and r is the periodic sequence with fundamental period (1,1,0,1).at n=47A026064
- Numbers whose base-5 representation has exactly 7 runs.at n=14A043607
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049735.at n=36A049737
- Numerators of the determinant of matrix (M(n) - H(n)), where H(n) is the n-th Hilbert matrix and M(n) is an n X n matrix with i,j-th entry i+j-1.at n=15A061913
- a(n) = A075443(A075451(n)).at n=28A075452
- Iccanobirt numbers (8 of 15): a(n) = R(a(n-1) + a(n-2) + a(n-3)), where R is the digit reversal function A004086.at n=18A102118
- Iccanobirt semiprimes (8 of 15): Semiprime numbers in A102118.at n=5A102198
- Index of first occurrence of n-th prime in A001203, the continued fraction for Pi.at n=41A107892
- Composite numbers generated by the Euler polynomial x^2 + x + 41.at n=22A145292
- Terms of A122782 which are not Carmichael numbers A002997.at n=36A153515
- Prime-generating polynomial: a(n) = 16*n^2 - 292*n + 1373.at n=41A181969
- Number of 2 X 2 matrices having all terms in {1,...,n} and determinant >= 2n.at n=14A211062
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+5x+5y>0.at n=16A211627
- Number of ordered triples (w,x,y) with all terms in {-n, ..., -1, 1, ..., n} and 5w + x + y > 0.at n=16A211630
- Semiprimes generated by the Euler polynomial x^2 + x + 41.at n=22A228183
- Euler pseudoprimes to base 5: composite integers such that abs(5^((n - 1)/2)) == 1 mod n.at n=16A262052
- The number of distinct positions on an infinite chessboard reachable by the (3,4)-leaper in <= n moves.at n=17A297741