4206
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8424
- Proper Divisor Sum (Aliquot Sum)
- 4218
- 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
- 1400
- Möbius Function
- -1
- Radical
- 4206
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 95
- 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 rooted planar 2-trees with n nodes.at n=8A001895
- Positive even numbers that are not the sum of a pair of twin primes.at n=33A007534
- Coordination sequence T2 for Zeolite Code LTN.at n=45A008141
- Molien series for A_9.at n=32A008632
- Number of partitions of n into at most 9 parts.at n=32A008638
- Coordination sequence T1 for Zeolite Code -CHI.at n=41A009846
- a(n) = F(n+1) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th non-Fibonacci number.at n=17A022799
- Number of partitions of n into 9 unordered relatively prime parts.at n=32A023029
- Numbers k such that Fibonacci(k) == 8 (mod k).at n=33A023177
- Number of partitions of n in which the greatest part is 9.at n=41A026815
- Every run of digits of n in base 5 has length 2.at n=29A033003
- Decimal part of n-th root of a(n) starts with digit 9.at n=11A034086
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 4 (mod 5).at n=51A035574
- Numerators of continued fraction convergents to sqrt(42).at n=4A041070
- Numbers whose base-8 representation has exactly 5 runs.at n=33A043627
- Numbers k such that 195*2^k-1 is prime.at n=43A050849
- Number of connected unlabeled vertex-transitive graphs with n nodes such that complement is also connected.at n=25A054917
- Numbers which are the sum of their proper divisors containing the digit 0.at n=16A059461
- a(n) = Sum_{ r = 0 to n} L(n,r), where L(n,r) (A067049) = lcm(n, n-1, n-2, ..., n-r+1)/lcm(1, 2, 3, ..., r).at n=15A061297
- a(n) = floor(e^n mod n^e).at n=34A066433