5065
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6084
- Proper Divisor Sum (Aliquot Sum)
- 1019
- 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
- 4048
- Möbius Function
- 1
- Radical
- 5065
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 72
- 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
- Number of minimal covers of an (n + 1)-set by a collection of n nonempty subsets, a(n) = A035348(n,n-1).at n=8A003469
- Crystal ball sequence for planar net 3.6.3.6.at n=47A008580
- Numbers k such that the continued fraction for sqrt(k) has period 45.at n=14A020384
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=25A025113
- Related to sorting procedure studied by West: number of permutations that are both sorted (i.e., obtainable as output of the sorting procedure) and one-stack sortable.at n=11A027432
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 21 (most significant digit on right and removing all least significant zeros before concatenation).at n=10A029538
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 6.at n=16A031419
- Number of ternary rooted trees with n nodes and height exactly 11.at n=16A036426
- Base-8 palindromes that start with 1.at n=33A043021
- Numbers having four 1's in base 8.at n=22A043428
- Number of minimal covers on n objects with 9 members.at n=9A046169
- Palindromes in factorial base.at n=34A046807
- Sizes of successive clusters in Z^4 lattice.at n=32A046895
- Sums of nonconsecutive factorial numbers.at n=27A060112
- Positions of the permutations which have the same rank in A055089 and A060118, i.e., the fixed points of permutations A060120 and A060127.at n=42A060133
- Numbers k such that sigma(k) and sigma(k+1) are nontrivial powers (A065496).at n=5A065522
- Numbers n such that phi(n-1) + phi(n+1) = phi(2n).at n=8A067701
- Numbers k such that the sum of the non-divisors of k between 1 and k is a perfect square.at n=9A076624
- Numbers n such that sigma(n) * antisigma(n) is a perfect square, where antisigma(n) = sum of the non-divisors of n that are between 1 and n.at n=8A076646
- Triangle, read by rows, where T(n,k) = (k/n)*Sum_{d|n} A096800(d,k).at n=59A096799