5840
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 13764
- Proper Divisor Sum (Aliquot Sum)
- 7924
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2304
- Möbius Function
- 0
- Radical
- 730
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 3
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
- 98
- 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
- a(n) = (9*n+1)*(9*n+8).at n=8A001534
- Coordination sequence T6 for Zeolite Code EUO.at n=47A008101
- E.g.f. log(1 + sin(x)*exp(x)).at n=9A009340
- Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (3,k)-perfect numbers.at n=15A019292
- a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=2 and a(2)=a(3)=1.at n=13A024735
- Number of partitions of n that do not contain 9 as a part.at n=31A027343
- Number of distinct products i*j*k with 1 <= i < j < k <= n.at n=46A027430
- Numbers k such that 183*2^k+1 is prime.at n=25A032468
- Base 7 digits are, in order, the first n terms of the periodic sequence with initial period 2,3,0,1.at n=4A037747
- Base-9 palindromes that start with 8.at n=11A043035
- Numbers whose base-3 representation contains exactly four 0's and four 2's.at n=20A045013
- a(n) = Sum_{d|n, n/d=1 mod 4} d^3.at n=17A050462
- a(n) = Sum_{d|n, n/d=3 mod 4} d^3.at n=53A050466
- Number of positive integers <= 2^n of form 6*x^2 + 7*y^2.at n=16A054182
- Row sums of array T as in A055215.at n=27A054405
- a(n) = Sum_{i=1..n} Sum_{j=1..i} (prime(i) - prime(j)).at n=20A062020
- Primitive subsequence of A066031: terms of A066031 which are not a multiple of some previous terms.at n=42A064623
- Triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} defined by a(0,0)=1, a(n,0)=A000670(n), a(n,n)=A000629(n), a(n,k) = a(n,k-1) + a(n-1,k-1); a(n+1,0) = Sum_{k=0..n} a(n,k).at n=23A073146
- (3*6^n + 2^n)/4.at n=5A090040
- Numbers whose set of base 9 digits is {0,8}.at n=9A097255