9434
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14580
- Proper Divisor Sum (Aliquot Sum)
- 5146
- 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
- 4576
- Möbius Function
- -1
- Radical
- 9434
- 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
- 60
- 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
- a(n) = floor( n*(n-1)*(n-2)/11 ).at n=48A011893
- a(n) is the smallest number that is the sum of 3 nonzero squares in exactly n ways.at n=40A025414
- Numbers whose set of base-8 digits is {2,3}.at n=36A032808
- a(n) is the smallest integer > 0 that cannot be obtained from the integers {1, ..., n} using each number at most once and the operators +, -, *, /, ^.at n=6A071794
- Even composites in A145832 with at least three distinct prime factors.at n=3A145916
- a(n) = Sum_{d|n} d*sigma(n/d)*sigma(d).at n=35A174468
- Sequence of traces arising in study of Thue-Morse sequence.at n=9A201170
- Number of nX1 1..7 arrays with every element value z a city block distance of exactly z from another element value z.at n=12A209212
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 150", based on the 5-celled von Neumann neighborhood.at n=32A270323
- Indices where records occur in A265432.at n=40A272675
- Number of partitions of n having a non-integer median.at n=43A307683
- Duplicate of A307683.at n=43A325348
- Numbers k with a Goldbach partition (p,q) such that k | (p*q - 1).at n=50A336582
- Number of integer partitions of n that are empty, or have smallest part dividing all the others, but do not have greatest part divisible by all the others.at n=34A343345
- a(n) is the smallest number k such that Sum_{j=1..k} (-1)^omega(j) = -n, where omega(j) is the number of distinct primes dividing j.at n=15A346456
- Coefficients of expansion of f(x) = (1+x*m(x))^5*(x^2*(x*m(x))'+1) where m(x) is the generating function for A001006.at n=8A353133