4814
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7560
- Proper Divisor Sum (Aliquot Sum)
- 2746
- 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
- 2296
- Möbius Function
- -1
- Radical
- 4814
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 72
- 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
- Number of ways to attack all squares on an n X n chessboard using the smallest possible number of queens with each queen attacking at least one other.at n=10A002566
- Shallit sequence S(3,13), a(n)=[ a(n-1)^2/a(n-2)+1 ].at n=5A010921
- Starting positions of strings of 2 3's in the decimal expansion of Pi.at n=36A050222
- Numbers k such that 171*2^k-1 is prime.at n=24A050837
- Numbers n such that n^2 contains exactly 8 different digits.at n=20A054036
- Numbers k such that sopf(k) + 1 = sopf(k+1), where sopf(k) = A008472(k).at n=16A064111
- a(n) = floor((5/4)^n).at n=38A065565
- Number of integers k such that phi(k) = 10^n.at n=19A072074
- Triangle read by rows: coefficients of polynomials E(n,x) related to partitions with parts occurring at most thrice.at n=19A098494
- Positions of records for terms in the continued fraction of Soldner's constant (A070769).at n=11A099805
- Number of compositions of n into pairwise relatively prime parts.at n=18A101268
- Column 0 of the matrix square of A102220, which equals the lower triangular matrix: [2*I - A008459]^(-1).at n=4A102224
- Number of binary strings of length n with no substrings equal to 0001 or 1010.at n=11A164399
- a(n) = number of ways to write n as a sum of distinct numbers <= n, where the addition is carryless mod 10.at n=21A169973
- Partial sums of ceiling(n^2/7).at n=46A175822
- Number of permutations of 1..n with displacements restricted to {-6,-5,-4,-2,-1,0,3}.at n=11A189596
- a(n) = A031287(n) + A031288(n) + A031289(n) + A031290(n) + A031291(n) + A031292(n) + A031293(n) + A031294(n) + A031295(n) + A031296(n).at n=40A193428
- Number of partitions of n into exactly 5 different parts with distinct multiplicities.at n=20A212116
- Number of (n+4) X 7 0..1 matrices with each 5 X 5 subblock idempotent.at n=8A224685
- Number of distinct values of the sum of i^2 over 9 realizations of i in 0..n.at n=23A225276