4325
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
- 6
- Divisor Sum
- 5394
- Proper Divisor Sum (Aliquot Sum)
- 1069
- 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
- 3440
- Möbius Function
- 0
- Radical
- 865
- Omega Function (Ω)
- 3
- 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
- 139
- 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
- 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=46A001844
- Coordination sequence T1 for Zeolite Code MEP.at n=39A008157
- Pseudoprimes to base 93.at n=32A020221
- Strong pseudoprimes to base 93.at n=8A020319
- Fibonacci sequence beginning 4,9.at n=14A022130
- Self-convolution of natural numbers >= 3.at n=24A023551
- Numbers that are the sum of 2 nonzero squares in exactly 3 ways.at n=43A025286
- Numbers that are the sum of 2 distinct nonzero squares in exactly 3 ways.at n=42A025304
- Nonsquarefree k such that Pell equation x^2 - k*y^2 = -1 is soluble.at n=35A031397
- Numbers with exactly five distinct base-8 digits.at n=25A031985
- Starting positions of strings of 2 3's in the decimal expansion of Pi.at n=32A050222
- Number of partitions into at most a(1) copies of 1, a(2) copies of 2, ...at n=41A052337
- a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1.5, p=2.at n=24A053522
- a(n) = (n + 2)*(2*n^2 - n + 3)/6.at n=23A056520
- Numbers k such that the Lucas Aurifeuillian primitive part B of Lucas(k) is prime.at n=43A061443
- a(n) = s(2*n) where s(0) = 0, s(1) = s(2) = 1, s(n) = abs(Sum_{k=2..n-1} (-1)^k * s(n-k) * s(k)).at n=44A072851
- Diagonal of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.at n=46A082019
- Length of the hypotenuse of an integer right triangle with the hypotenuse being one more than the longer side. The shorter sides are just consecutive odd numbers 3, 5, 7, ...at n=45A099776
- Position of n-th n after the decimal point in Pi.at n=32A101196
- The first pair of digits sums up to 7. So does the second pair. And the third one and the fourth one, etc., with a(n) < a(n+1). When constructing the sequence, choose the next digits so as to slow the growth of the sequence as much as possible.at n=52A101325