4203
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 6084
- Proper Divisor Sum (Aliquot Sum)
- 1881
- 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
- 2796
- Möbius Function
- 0
- Radical
- 1401
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 64
- 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
- no
- Odd
- yes
Appears in sequences
- f-vectors for simplicial complexes of dimension at most 2 on at most n-1 vertices.at n=10A011827
- f-vectors for 6-neighborly simplicial complexes on n+5 vertices.at n=4A011838
- Numbers k such that Fib(k) == -34 (mod k).at n=28A023169
- a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Fibonacci number).at n=15A023488
- a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th non-Lucas number).at n=15A023494
- a(n) = b(n) + d(n), where b(n) = ( (n+1)st Fibonacci number) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).at n=17A023499
- n written in fractional base 6/4.at n=21A024637
- Number of rooted compound windmills with n nodes and leaves of 2 colors with no symmetries.at n=8A032172
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 3 and 4 (mod 5).at n=47A035587
- Number of primes less than 1000n.at n=39A038812
- Number of primes less than 10000n.at n=3A038813
- Denominators of continued fraction convergents to sqrt(546).at n=8A042045
- a(n)=(s(n)+6)/10, where s(n)=n-th base 10 palindrome that starts with 4.at n=42A043083
- Numbers whose base-8 representation has exactly 5 runs.at n=31A043627
- Numbers k such that the string 0,3 occurs in the base 10 representation of k but not of k-1.at n=45A044335
- Numbers whose base-5 representation contains exactly two 1's and three 3's.at n=18A045243
- Integers k such that in the list of divisors of k (in base 5), each digit 0-4 appears equally often.at n=9A045869
- Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities).at n=14A045940
- Numbers k such that k and k+1 both have 6 divisors.at n=42A049103
- A Diaconis-Mosteller approximation to the Birthday problem function.at n=22A050255