5648
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 10974
- Proper Divisor Sum (Aliquot Sum)
- 5326
- 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
- 2816
- Möbius Function
- 0
- Radical
- 706
- Omega Function (Ω)
- 5
- 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
- 129
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of a modular function for Gamma_0(15).at n=15A002510
- Numbers k such that k^4 can be written as a sum of four positive 4th powers.at n=38A003294
- a(n) = n*(11*n+1)/2.at n=32A022269
- Duplicate of A022269.at n=31A026817
- Number of dyslexic rooted compound windmills with n nodes.at n=11A032289
- Numbers n such that n | p(n)*q(n), where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009).at n=39A060744
- Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 11 (most significant digit on right).at n=16A061940
- Number of knot diagrams of type 1PI with n crossings and two outgoing strings.at n=6A067647
- Smallest integer >= 0 of the form x^4 - n^3.at n=31A070928
- a(n) = 4^n + 6^n + 8^n.at n=4A074566
- a(1) = 1, a(n+1) is the smallest number such that there are n primes between a(n) and a(n+1) exclusive.at n=38A075342
- Solutions to A096509[x]=6; number of prime-powers [including primes] in the neighborhood of x with Ceiling[Log[x]] radius equals 6.at n=1A096517
- Numbers k such that k^4 can be written as a sum of four distinct positive 4th powers.at n=38A096739
- Number of binary rooted trees with n nodes and internal path length n.at n=40A108643
- Each term is previous term plus floor of root mean square of two previous terms.at n=15A114834
- Number of partitions of 1 into distinct fractions i/j with 1<=i<j<=n and i,j coprime.at n=22A116084
- Numbers of the form x^4 + 6*x^2*y^2 + y^4 (where x,y are positive integers).at n=23A135797
- Number of Section I primes between 2^n and 2^(n+1). See A135832.at n=35A135833
- Numbers k such that the three numbers k-1, k+3 and k+5 are all prime.at n=43A144840
- Integers of the form : (n plus OR minus 1 = prime) and (n plus OR minus 3 = prime) and (n plus OR minus 5 = prime) ...and (n plus OR minus 11 = prime).at n=10A145213