9424
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 19840
- Proper Divisor Sum (Aliquot Sum)
- 10416
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 1178
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 122
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for 8-dimensional cubic lattice.at n=5A008416
- tanh(arcsin(arcsin(x)))=x+4/5!*x^5+136/7!*x^7+9424/9!*x^9...at n=4A012070
- A convolution triangle of numbers obtained from A001792.at n=39A030523
- Number of points of L1 norm 5 in cubic lattice Z^n.at n=8A035599
- Numbers n such that n and n-1 are differences between 2 positive cubes in at least one way.at n=10A038595
- Numbers ending with '4' that are the difference of two positive cubes.at n=24A038859
- (n+4)^3 - n^3.at n=25A038866
- Numbers that divide the sum of cubes of their divisors.at n=33A046763
- a(n) = (1/6)*(2*n - 3)*(n + 2)*(n + 1).at n=32A058373
- a(n) = |{m : multiplicative order of 5 mod m=n}|.at n=47A059887
- Numbers k such that sopf(k) = sopfr(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=20A064678
- Number of nodes in virtual, "optimal", chordal graphs of diameter 5, degree =n+1.at n=13A067969
- 3-apexes of Omega: numbers k such that Omega(k-3) < Omega(k-2)< Omega(k-1) < Omega(k) > Omega(k+1) > Omega(k+2) > Omega(k+3), where Omega(m) = the number of prime factors of m, counting multiplicity.at n=2A076760
- Let u(1)=u(2)=1, u(3)=2n, u(k) = abs(u(k-1)-u(k-2)-u(k-3)) and M(k) = Max_{i<=i<=k} u(i), then for any k >= A078109(n), M(k) = floor(sqrt(k + a(n))).at n=17A078108
- a(n) = 8*a(n-1) - 6*a(n-2), a(0) = 1, a(1) = 4.at n=5A084134
- Number of triangular partitions of n of order 3.at n=28A084439
- Numbers k such that the decimal expansion of Pi^k begins (after the decimal point) with k.at n=3A100323
- Admirable numbers n such that the subtracted divisor is > sqrt(n).at n=26A109321
- Lesser of twin admirable numbers: k such that k and k+2 are both admirable numbers.at n=34A109730
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n that start with exactly k (0,1) steps (or, equivalently, with exactly k (1,0) steps).at n=39A110171