9429
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14400
- Proper Divisor Sum (Aliquot Sum)
- 4971
- 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
- 5376
- Möbius Function
- -1
- Radical
- 9429
- 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
- 122
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that k | 5^k + 1.at n=39A015951
- Larger members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).at n=28A054572
- Numbers m such that there are precisely 3 groups of order m.at n=40A055561
- McKay-Thompson series of class 36C for Monster.at n=40A058646
- Numbers which need eight 'Reverse and Add' steps to reach a palindrome.at n=38A065213
- Numbers which retain their position in A073666 (position not disturbed by the rearrangement).at n=38A073667
- Solutions to A096509[x]=6; number of prime-powers [including primes] in the neighborhood of x with Ceiling[Log[x]] radius equals 6.at n=3A096517
- Triangle, read by rows, where T(n,k) equals the sum of squares of numbers < 2^n having exactly k ones in their binary expansion.at n=16A110200
- a(n) = sum of squares of numbers < 2^n having exactly 2 ones in their binary representation.at n=5A110202
- Numbers k such that k^3 divides 5^(k^2) + 1.at n=6A128679
- Positions of 2's in A171922.at n=24A171925
- Numbers k such that 12*k - 5, 12*k - 1, 12*k + 1, and 12*k + 5 are primes.at n=42A174372
- Number of partitions of n having no parts with multiplicity 7.at n=33A184642
- a(n) = (A216363(n) - 1)/118.at n=19A216380
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 637", based on the 5-celled von Neumann neighborhood.at n=19A273306
- Numbers k such that k^2 divides 5^k + 1.at n=6A292331
- Unique terms in sequence A294640, in order by size.at n=60A294641
- Numbers n=2*k-1 where Sum_{j=1..k} (-1)^(j+1) * d(2*j-1) achieves a new record, with d(n) = number of divisors of n (A000005).at n=17A318737
- G.f. A(x) satisfies: A(x) = P(x)/Q(x) where P(x) = Sum_{n>=0} (n+1)*x^n*A(x)^n/(1 - x*A(x)^(n+1)) and Q(x) = Sum_{n>=0} x^n*A(x)^n/(1 - x*A(x)^(n+1)).at n=8A341382
- Numbers that are the sum of nine fourth powers in seven or more ways.at n=42A345591