1625
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2184
- Proper Divisor Sum (Aliquot Sum)
- 559
- 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
- 1200
- Möbius Function
- 0
- Radical
- 65
- Omega Function (Ω)
- 4
- 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
- 135
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Number of cyclic permutations of [n] with no i -> i+1 (mod n).at n=8A000757
- Crystal ball sequence for hyperbolic tessellation 3^7 (from triangle group (2,3,7)).at n=6A001360
- Centered square numbers: a(n) = 2*n*(n+1)+1. Sums of two consecutive squares. Also, consider all Pythagorean triples (X, Y, Z=Y+1) ordered by increasing Z; then sequence gives Z values.at n=28A001844
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals up to rotation.at n=24A003451
- Coefficients of the '2nd-order' mock theta function A(q).at n=25A006304
- Least hypotenuse of n distinct Pythagorean triangles.at n=10A006339
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=27A007077
- 7th-order maximal independent sets in path graph.at n=48A007381
- Coordination sequence T4 for Zeolite Code EMT.at n=33A008089
- Coordination sequence T2 for Zeolite Code LTN.at n=28A008141
- Molien series of 5 X 5 upper triangular matrices over GF( 2 ).at n=64A008644
- Numbers k such that k^2 and k have same last 3 digits.at n=7A008853
- Expansion of g.f. 1/((1-2*x)*(1-11*x)).at n=3A016135
- Expansion of g.f. 1/(1 - x^7 - x^8 - x^9 - x^10 - x^11).at n=52A017860
- Powers of cube root of 2 rounded down.at n=32A017979
- Powers of cube root of 2 rounded to nearest integer.at n=32A017980
- Powers of cube root of 4 rounded down.at n=16A017985
- Powers of cube root of 4 rounded to nearest integer.at n=16A017986
- Powers of cube root of 16 rounded down.at n=8A018021
- Powers of cube root of 16 rounded to nearest integer.at n=8A018022