5210
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9396
- Proper Divisor Sum (Aliquot Sum)
- 4186
- 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
- 2080
- Möbius Function
- -1
- Radical
- 5210
- Omega Function (Ω)
- 3
- 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
- 103
- 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
- Narayana-Zidek-Capell numbers: a(n) = 1 for n <= 2. Otherwise a(2n) = 2a(2n-1), a(2n+1) = 2a(2n) - a(n).at n=15A002083
- a(n) = ceiling(1000*log_2(n)).at n=36A004267
- a(n) = floor(n*phi^13), where phi is the golden ratio, A001622.at n=10A004928
- a(n) = round(n*phi^13), where phi is the golden ratio, A001622.at n=10A004948
- Coordination sequence T2 for Zeolite Code HEU.at n=47A008117
- Coordination sequence T5 for Zeolite Code NON.at n=44A008216
- Numbers whose base-4 representation contains exactly four 1's and two 2's.at n=25A045107
- Composite numbers k such that all prime factors of k are a substring of k.at n=42A050694
- Number of solutions to c(0)F(0) + ... + c(n)F(n) = 0, where c(i) = +-1 for i >= 0, number of (+1)'s >= number of (-1)'s, F(i) = A000045(i) = Fibonacci numbers.at n=35A058301
- Numbers that contain as proper substrings every maximal prime power dividing them.at n=3A059401
- Sides of integer Heronian triangles [prime(A068964(n)), prime(A068964(n)+1), a(n)] with area A068966(n).at n=7A068965
- Positions of A080299 in A014486.at n=17A080298
- Numbers n such that the Zsigmondy number Zs(n,5,1) differs from the n-th cyclotomic polynomial evaluated at 5.at n=50A093109
- Numbers n such that 5*10^n + 8*R_n + 1 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=10A103024
- Number of ways to split 1, 2, 3, ..., 5n into n arithmetic progressions each with 5 terms.at n=11A104431
- Numbers k such that A120292(k) is composite.at n=25A141779
- Number of paths of the simple random walk on condition that the median applied to the partial sums S_0=0, S_1,...,S_n, n odd (n=15 in this example), is equal to integer values k, -[n/2]<=k<=[n/2].at n=7A146206
- Number of paths of the simple random walk on condition that the [n/2]th ordered value S_([n/2]) of the partial sums S_0=0, S_1,...,S_n, n odd (n=15 and S_(7) in this example), is equal to k, [ -n/2]-1<=k<=[n/2].at n=9A146207
- Number of paths of the simple random walk on condition that the [n/2]th ordered value S_([n/2]) of the partial sums S_0=0, S_1,...,S_n, n odd (n=15 and S_(7) in this example), is equal to k, [ -n/2]-1<=k<=[n/2].at n=7A146207
- Partial sums of A002503.at n=29A176358