5730
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 13824
- Proper Divisor Sum (Aliquot Sum)
- 8094
- 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
- 1520
- Möbius Function
- 1
- Radical
- 5730
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 28
- 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
- Numbers whose sum of divisors is a cube.at n=31A020477
- a(n) = T(2n,n), where T is the array in A026120.at n=6A026128
- a(n) = T(n,[ n/2 ] - 1), where T is the array in A026120.at n=12A026133
- Numbers with exactly 4 distinct palindromic prime factors.at n=11A046402
- de Bruijn's S(5,n) = Sum_{k = 0..2*n} (-1)^(n+k)*binomial(2*n, k)^5.at n=2A050984
- Numbers k such that prime(k+1)-(k+1)*tau(k+1) = prime(k-1)-(k-1)*tau(k-1) where tau(k) = A000005(k) is the number of divisors of k.at n=40A067335
- Numbers k such that Cyclotomic(k,k) (i.e., the value of k-th cyclotomic polynomial at k) is a prime number.at n=23A070519
- a(n) = (1/24)*(sigma_3(2*n-1) - sigma_1(2*n-1)).at n=25A081861
- Smallest multiple of prime(n) of the form r*prime(n-1) + s*prime(n-2). r and s are positive integers.at n=40A085950
- 30*a(n) is the gap between sexy prime triples in the n-th sexy prime triple triple whose initial term is 17.at n=7A090891
- Numbers n not of the form i^2+(i+1)^2 such that there are integers a < b with a^2+(a+1)^2+...+(n-1)^2 = n^2+(n+1)^2+...+b^2.at n=16A094523
- a(1)=1. a(n) = a(n-1) + sum of the squares which are among the first (n-1) terms of the sequence.at n=27A101135
- Maximum element in the continued fraction expansion of F(n+1)^5/F(n)^5 where F=A000045.at n=10A113506
- Numbers k such that k^2 + 11 and k^2 + 13 are primes.at n=22A113537
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k UHD's, where U=(1,1),H=(1,0),D=(1,-1) (0<=k<=floor(n/3)).at n=31A114583
- a(n) = 6 + floor( Sum_{j=1..n-1} a(j)/4 ).at n=31A120164
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, -1), (1, -1, 1), (1, 0, 1)}.at n=8A148883
- Number of binary strings of length n with no substrings equal to 0001 0010 or 1100.at n=12A164451
- Sequence generated from Lim:_{n..inf.} M^n, M = an infinite lower triangular matrix with (1,3,3,3,...) in every column, shifted down twice.at n=30A171370
- Numbers k such that k^2 +-11 are primes.at n=22A176683