1897
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2176
- Proper Divisor Sum (Aliquot Sum)
- 279
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1620
- Möbius Function
- 1
- Radical
- 1897
- 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
- 68
- 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
- Padovan sequence (or Padovan numbers): a(n) = a(n-2) + a(n-3) with a(0) = 1, a(1) = a(2) = 0.at n=33A000931
- Expansion of 1/((1+x)*(1-x)^7).at n=8A001769
- Number of ways to halve an n X n chessboard.at n=6A003155
- a(0) = 0, a(1) = a(2) = a(3) = 1; thereafter, a(n) = a(n-1) + a(n-2) + a(n-4).at n=16A005251
- Number of Twopins positions.at n=39A005686
- Number of triangle-free graphs on n vertices.at n=8A006785
- Number of 3 X 3 symmetric stochastic matrices under row and column permutations.at n=48A008764
- Pisot sequences E(4,7), P(4,7).at n=11A010901
- a(0) = 0, a(1) = 1, a(2) = 1; thereafter a(n) = 5*a(n-1) - 4*a(n-2) + a(n-3).at n=9A012855
- Positive integers n such that 2^n == 2^7 (mod n).at n=47A015927
- Pseudoprimes to base 29.at n=22A020157
- Pisot sequences E(7,9), P(7,9).at n=20A020720
- Numbers k such that Fib(k) == 13 (mod k).at n=15A023178
- A024723(n+3)/2.at n=14A024724
- Index of 10^n within the sequence of the numbers of the form 4^i*10^j.at n=47A025742
- a(n) = T(n,n-1), T given by A026536. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 1.at n=10A026538
- Number of partitions of n in which the least part is 5.at n=58A026798
- a(n) = n^2 + n + 5.at n=43A027690
- Squarefree n such that Q(sqrt(n)) has class number 5.at n=14A029705
- Numbers having period-2 7-digitized sequences.at n=37A031202