4976
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 9672
- Proper Divisor Sum (Aliquot Sum)
- 4696
- 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
- 2480
- Möbius Function
- 0
- Radical
- 622
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 90
- 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) = ceiling(n*phi^11), where phi is the golden ratio, A001622.at n=25A004966
- Expansion of eta(q^10)^12/(eta(q^2)^4*eta(q^5)^8) in powers of q.at n=17A006710
- a(n) = Sum_{k=0..2n} (k+1) * A026584(n, k).at n=7A027286
- Number of semi-meanders of order n with 3 components.at n=7A046722
- Triangle of numbers of semi-meanders of order n with k components.at n=52A046726
- a(n) = T(2n-1,n), array T given by A048225.at n=37A048234
- 1/2-Smith numbers.at n=31A050224
- Sum of a(n) terms of 1/k^(4/5) first exceeds n.at n=23A056180
- Number of primitive (aperiodic) reversible string structures with n beads using a maximum of three different colors.at n=9A056332
- Number of non-unimodal permutations of n items (i.e., those which do not simply go up for the first part and then down for the rest, but at some point go down then up).at n=7A059204
- a(n) = (n-1)!-n^tau(n)/n^2.at n=6A069152
- Least x = a(n) such that sum of common prime divisors (without multiplicity) of sigma(x) and phi(x) equals n, or 0 if such number (apparently) does not exist.at n=32A082056
- Partial sums of A084263.at n=30A084570
- Numbers in increasing order such that successive sums are squares and successive differences are squarefree.at n=37A090956
- Numbers k such that 6^k+5^(k-1) is prime.at n=18A093765
- Nearest integer to the n-th root of e leading to a generalized closed form for Zeta(s).at n=20A108925
- Number of partitions of n which represent losing Chomp positions.at n=50A112470
- a(1)=1, a(n)=a(n-1)+n^0 if n odd, a(n)=a(n-1)+ n^2 if n is even.at n=30A135301
- 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, 0, -1), (0, 1, 1), (1, -1, 1)}.at n=8A148862
- Number of permutations of {1,...,n} avoiding adjacent step pattern up, down, up, down, down, down.at n=7A177542