5453
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6720
- Proper Divisor Sum (Aliquot Sum)
- 1267
- 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
- 4320
- Möbius Function
- -1
- Radical
- 5453
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 67
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A014306.at n=30A024477
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=24A024847
- Numbers having four 3's in base 5.at n=29A043364
- a(n) = floor(A*a(n-1) + B*a(n-2) + C)/p^r, where p^r is the highest power of p dividing floor(A*a(n-1) + B*a(n-2) + C), A=1.0001, B=1.0001, C=1, p=2.at n=39A053521
- Composite numbers not divisible by 2, 3 or 5 which contain their largest prime factor as a substring in base 2.at n=38A063137
- Triangle of coefficients, read by rows of (2n+1) terms, where the n-th row forms a polynomial in x, P(n,x), of degree 2n and satisfies: P(n,x) = [Sum_{k=1..n} 1/(k + x + x^2)]*[Product_{k=1..n} (k + x + x^2)].at n=27A074248
- a(1) = 1, a(n+1) is the largest squarefree number <= n*a(n).at n=7A077001
- Numbers k such that k*primorial(2473)-1 is prime.at n=42A087832
- a(n)=A089551(n)/2.at n=46A089558
- Triangle read by rows giving coefficients of polynomials arising in successive differences of (n!)_{n>=0}.at n=33A094791
- Number of primes in range [2^n+1, 2^(n+1)] whose binary expansion begins '10' (A080165).at n=16A095765
- Odd numbers n such that there exists a solution to lcm(s,z-s) = n, lcm(t,z-t) = n-2 and 0 < s+t < z < n.at n=22A108157
- Where record values occur in A062039.at n=51A123644
- a(n) = n*(3*n + 10).at n=41A140678
- A144325(n) + A144313(n) + A144315(n).at n=11A144715
- a(n) = (p(n)*p(n+2) - 3*p(n+1))/2, where p(n) is the n-th odd prime.at n=25A152529
- Infinite product of triangle A167271 columns.at n=19A167273
- Potential magic constants of 7 X 7 magic squares composed of consecutive primes.at n=12A188536
- Dispersion of ([n*sqrt(2)+n]), where [ ]=floor, by antidiagonals.at n=57A191438
- a(n) = (5*n^2 - 3*n + 2)/2.at n=47A192136