4453
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4588
- Proper Divisor Sum (Aliquot Sum)
- 135
- 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
- 4453
- 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
- 139
- 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
- Numerator of [x^(2n)] of the Taylor expansion sec(cosec(x)-cot(x)) = 1+ x^2/8 +13*x^4/384 +397*x^6/46080 +4453*x^8/2064384 + ... .at n=4A013527
- Pseudoprimes to base 72.at n=22A020200
- Pseudoprimes to base 74.at n=24A020202
- Pseudoprimes to base 82.at n=44A020210
- Strong pseudoprimes to base 74.at n=10A020300
- Numbers k such that the continued fraction for sqrt(k) has period 44.at n=35A020383
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (F(2), F(3), ...).at n=13A024481
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (F(2), F(3), F(4), ...).at n=12A025101
- a(n) = n-th prime number * n-th lucky number.at n=17A032601
- Concatenation of n and n + 9 or {n,n+9}.at n=43A032614
- Molien series for group G_{1,2}^{8} of order 1536.at n=21A051462
- Counterbalanced numbers: Composite numbers k such that phi(k)/(sigma(k)-k) is an integer.at n=8A055940
- Numbers m such that the positive values of m - A002110(k) are all primes (k > 0).at n=29A068372
- Duplicate of A055940.at n=8A070158
- a(1) = 10; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=39A074346
- Numbers k such that there are exactly 8 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 8.at n=32A080386
- a(n) = (3*3^n + (-5)^n)/4.at n=6A083229
- Semiperimeter of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=7A089549
- a(n) = prime(n)*prime(n+3).at n=17A090090
- Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and divisible by phi(k), that is A065395(k)/A000010(k) is a nonzero integer.at n=32A092587