5790
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 13968
- Proper Divisor Sum (Aliquot Sum)
- 8178
- 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
- 1536
- Möbius Function
- 1
- Radical
- 5790
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 54
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of a modular function.at n=16A006709
- Coordination sequence T4 for Zeolite Code VET.at n=46A009905
- a(n) = n*(29*n - 1)/2.at n=20A022286
- a(n) = position of 3*n^2 in sequence A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <= i <= j <= k).at n=43A025056
- a(n) = (d(n)-r(n))/2, where d = A026060 and r is the periodic sequence with fundamental period (1,0,0,0).at n=32A026061
- a(n) = Sum_{i=0..n} Sum_{j=0..n} A026626(i,j).at n=11A026635
- Sums of five consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2.at n=32A027578
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=15A049923
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=40A050065
- Number of primitive (aperiodic) palindromes using exactly three different symbols.at n=14A056464
- Number of primitive (period n) periodic palindromes using exactly three different symbols.at n=14A056499
- Sides of integer Heronian triangles [A068967(n), prime(A068967(n)), a(n)] with area A068969(n).at n=14A068968
- Numbers n such that n and the n-th prime have the same digits.at n=6A074350
- a(n) = floor((n+2)^(n+2)/n^n).at n=27A078111
- Numbers k such that k*prime(k) -+ 1 are twin primes.at n=28A085637
- Number of meaningful differential operations of the n-th order on the space R^5.at n=12A090990
- Molien series for symmetrized weight enumerators of self-dual codes over GF(4) + GF(4)u with u^2 = 0.at n=33A092549
- Numbers n such that n^2+n+41 (Euler's "prime generating polynomial") is not squarefree.at n=34A097823
- Numbers k such that the sum of the first k primes is prime and the sum of the squares of the first k primes is also prime.at n=25A124225
- Fixed points of A067581.at n=13A137857