4367
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4776
- Proper Divisor Sum (Aliquot Sum)
- 409
- 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
- 3960
- Möbius Function
- 1
- Radical
- 4367
- Omega Function (Ω)
- 2
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 139
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Coefficient of q^(2n-1) in the series expansion of Ramanujan's mock theta function f(q).at n=38A000199
- Number of partitions of n into Fibonacci parts (with a single type of 1).at n=52A003107
- Coordination sequence T8 for Zeolite Code EUO.at n=41A008103
- a(n) is least k such that k and 7k are anagrams in base n (written in base 10).at n=26A023099
- Numbers with exactly 6 2's in their ternary expansion.at n=24A023704
- a(n) = Sum_{k = 1..n} k*floor((n + prime(k))/k).at n=39A024929
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 12.at n=10A031690
- Number of partitions satisfying cn(0,5) + cn(1,5) + cn(4,5) <= cn(2,5) + cn(3,5).at n=33A039878
- Numerators of continued fraction convergents to sqrt(859).at n=5A042658
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= n/3.at n=15A047193
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n-1)/3.at n=15A048005
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n+1)/3.at n=15A048038
- a(n) = T(2n-1,n), array T given by A048201.at n=33A048208
- Starting positions of strings of 2 0's in the decimal expansion of Pi.at n=32A050201
- Numbers k such that 255*2^k-1 is prime.at n=30A050886
- Numbers k such that 273*2^k-1 is prime.at n=36A050895
- Number of unlabeled rooted trees with n leaves in which the degrees of the root and all internal nodes are >= 3.at n=17A052525
- Numbers k such that k^2 + k + 1, k^3 + k + 1 and k^4 + k + 1 are all prime.at n=23A057683
- Nearest integer to (n+1)^3/9.at n=33A060999
- a(n) = floor(n^3/9).at n=34A061263