5465
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6564
- Proper Divisor Sum (Aliquot Sum)
- 1099
- 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
- 4368
- Möbius Function
- 1
- Radical
- 5465
- 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
- 160
- 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
- arcsinh(sec(x)*arcsin(x))=x+3/3!*x^3+13/5!*x^5+7/7!*x^7+5465/9!*x^9...at n=4A012789
- Number of trees on n nodes with forbidden limbs.at n=16A014281
- Numbers k such that the continued fraction for sqrt(k) has period 19.at n=35A020358
- Number of 8's in all partitions of n.at n=36A024792
- Number of partitions of n into an even number of parts, the least being 3; also, a(n+3) = number of partitions of n into an odd number of parts, each >=3.at n=54A027195
- An "extremely strange sequence": a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p dividing [ A*a(n)+B ] and p=2, A=4.001, B=1.2.at n=9A028948
- Numbers having four 3's in base 5.at n=32A043364
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 4).at n=56A046778
- a(n)=T(n,n+1), array T as in A049735.at n=29A049741
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 21.at n=8A051986
- Numbers k such that 2^k mod k = 2^k mod k^2.at n=21A068535
- Antidiagonal sums of square array A082011 divided by the number of the antidiagonal.at n=37A082015
- Number of rooted directed trees on n nodes with a red root.at n=4A097627
- Consider the family of directed multigraphs enriched by the species of set partitions. Sequence gives number of those multigraphs with n labeled loops and arcs.at n=4A098622
- Numbers n such that n^2-6 and n^2+6 are both prime.at n=24A108403
- Shadow of N (natural numbers), also of Champernowne's shadow.at n=37A110623
- a(0) = 3, a(1) = 5, a(2) = 1, and a(n) = (2^(1 + n) - 11*(-1)^n)/3 for n > 2.at n=13A115335
- Number of permutations of length n which avoid the patterns 213, 1234, 4312.at n=45A116720
- Numbers k that are not powers of 2 such that 2^k mod k = 2^k mod k^2; or A068535 with powers of 2 excluded.at n=8A125773
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 00100-00100-00100-11111 pattern in any orientation.at n=13A147319