4784
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 10416
- Proper Divisor Sum (Aliquot Sum)
- 5632
- 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
- 2112
- Möbius Function
- 0
- Radical
- 598
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 121
- 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
- Coordination sequence T2 for Zeolite Code NAT.at n=46A008204
- Coordination sequence for alpha-Mn, Position Mn4.at n=18A009953
- Self-convolution of natural numbers >= 3.at n=25A023551
- Least term in period of continued fraction for sqrt(n) is 6.at n=26A031430
- Multiplicity of highest weight (or singular) vectors associated with character chi_14 of Monster module.at n=40A034402
- Number of 4-ary rooted trees with n nodes and height exactly 8.at n=14A036632
- Truncated triangular pyramid numbers: a(n) = Sum_{k=9..n} (k*(k+1)/2 - 45).at n=23A051943
- Numbers with a sum of digits equal to their greatest prime factor.at n=34A052021
- Smallest number m larger than prime(n) such that prime(n) = sum of digits of m and prime(n) = largest prime factor of m (or 0 if no such number exists).at n=7A052022
- Numbers k such that phi(x) = k has exactly 11 solutions.at n=15A060674
- a(n) = prime((n+1)!) - prime(n!).at n=4A075489
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-1,0,2}.at n=18A079987
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,0,1}.at n=39A080002
- Consider recurrence b(0) = n/3, b(n) = b(n-1)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.at n=20A083863
- Number of primes of the form 6k+1 less than 10^n.at n=4A091115
- Numbers k such that k^2+1 and (k+2)^2+1 are both prime; twin k^2+1 primes.at n=45A096012
- Number of triangles created when a square sheet of paper is folded n times, the first time by one of the diagonals of the square and then by the median of the square triangle.at n=8A096227
- Expansion of psi(x^2) / f(-x) in powers of x where psi(), f() are Ramanujan theta functions.at n=26A098613
- A sieve transform applied to Euler's phi function A000010 starting at 4.at n=40A100426
- a(n) = Knuth's Fibonacci (or circle) square "n o n".at n=45A101332