5819
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
- 6
- Divisor Sum
- 6636
- Proper Divisor Sum (Aliquot Sum)
- 817
- 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
- 5060
- Möbius Function
- 0
- Radical
- 253
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 142
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(n+1)^2/2.at n=22A006002
- Coordination sequence for Ni2In, Position Ni1 and In.at n=23A009941
- Positive integers k such that k divides 12^k - 1.at n=6A014951
- Numbers k such that k | 10^k + 1.at n=6A015958
- a(n) = (1/2)*floor(n/2)*floor((n-1)/2)*floor((n-2)/2).at n=47A028724
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 23 (most significant digit on left).at n=19A029468
- a(n) = 11*n^2.at n=23A033584
- Number of partitions in parts not of the form 17k, 17k+3 or 17k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=34A035964
- Number of partitions of n into parts not of the form 25k, 25k+10 or 25k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=30A036009
- Numbers k that divide 7^k + 4^k.at n=7A045592
- Numbers k that divide 6^k + 5^k.at n=8A045595
- Numbers with a sum of digits equal to their greatest prime factor.at n=39A052021
- Least k for which the integers Floor(k/m^2) for m=1,2,...,n are distinct.at n=26A054062
- Numbers k such that k | 11^k + 10^k + 9^k + 8^k.at n=12A057240
- Numbers n such that n | 7^n + 6^n + 5^n + 4^n.at n=13A057244
- Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.at n=48A057492
- Numbers n such that n | 7^n + 5^n + 3^n +1.at n=20A057830
- Binary string self-substitutions: a(n) is obtained by substituting the binary expansion of n for each 1-bit in the binary expansion of n.at n=11A065159
- Numbers k such that gcd(3k,8^k+1) = 3 but k does not divide the numerator of B(2k) (the Bernoulli numbers).at n=9A070193
- a(n) = n*(2*n+1)^2.at n=11A084367