4312
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 10260
- Proper Divisor Sum (Aliquot Sum)
- 5948
- 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
- 1680
- Möbius Function
- 0
- Radical
- 154
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 51
- 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 strict 5th-order maximal independent sets in cycle graph.at n=47A007393
- Coordination sequence T1 for Zeolite Code MEL.at n=42A008150
- Coordination sequence for alpha-Mn, Position Mn4.at n=17A009953
- a(n) = n*(9*n-2).at n=22A013656
- Multiplicity of K_3 in K_n.at n=49A014557
- n is equal to the number of 1's in all numbers <= n written in base 6.at n=15A014890
- Powers of fifth root of 5 rounded to nearest integer.at n=26A018127
- Powers of fifth root of 5 rounded up.at n=26A018128
- Sequence satisfies T^2(a)=a, where T is defined below.at n=47A027594
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 7 (most significant digit on left).at n=42A029452
- Decimal representation of permutations of lengths 1, 2, 3, ... arranged lexicographically.at n=31A030299
- Numbers whose base-5 representation contains exactly two 1's and three 2's.at n=25A045228
- Coordination sequence T2 for Zeolite Code AEN.at n=41A047951
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049727.at n=35A049739
- 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=43A050024
- 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=43A050040
- 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=43A050056
- Diagonally symmetric n-celled polyominoes with 1 hole.at n=12A057423
- a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 3.at n=7A061515
- Convolution of A000010 with itself.at n=41A065093