4712
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 9600
- Proper Divisor Sum (Aliquot Sum)
- 4888
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2160
- Möbius Function
- 0
- Radical
- 1178
- Omega Function (Ω)
- 5
- 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
- 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
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=30A003452
- Primitive pseudoperfect numbers.at n=66A006036
- Expansion of (2 - x)^4/(1 - x)^8.at n=5A006637
- Coordination sequence T5 for Zeolite Code GOO.at n=47A008115
- Coordination sequence T1 for Zeolite Code MON.at n=42A008181
- If a, b in sequence, so is ab+8.at n=24A009331
- Coordination sequence T3 for Zeolite Code VSV.at n=44A009916
- Sequence satisfies T^2(a)=a, where T is defined below.at n=48A027594
- Numbers having four 2's in base 5.at n=34A043360
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=12A049956
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the smallest integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=45A050024
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=45A050040
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 1.at n=45A050056
- a(n) = (-1)^n * Sum_{i=0..n} binomial(n+1,i+1)*prime(i+1).at n=8A050513
- Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).at n=41A056242
- Numbers k such that the product of the digits of k is equal to the sum of the prime factors of k, counted with multiplicity.at n=19A065774
- Expansion of g.f. x*(1+x)^4/(1-x)^6.at n=8A069038
- a(0)=1; a(n) = sigma_1(n) + sigma_3(n).at n=16A092345
- Least linear combinations of phi(n) and sigma(n) are multiple.at n=41A094702
- Least number beginning with n such that every partial sum is a prime.at n=46A095157