9414
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20436
- Proper Divisor Sum (Aliquot Sum)
- 11022
- 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
- 3132
- Möbius Function
- 0
- Radical
- 3138
- Omega Function (Ω)
- 4
- 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
- 34
- Smith Number
- yes
- 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
- Sum of primes dividing the repunit numbers (with repetition).at n=10A064798
- Sum of next n integer interprimes (cf. A024675).at n=14A075673
- Numbers k such that 8*10^k + 7*R_k - 4 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=7A103090
- Each term k provides a value of (sum-of-digits of 5^k)/k that is closer to Pi than the previous value.at n=12A119666
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, -1), (1, -1, 0), (1, 1, 0)}.at n=8A149270
- Number of 8X8 arrays of squares of integers, symmetric under 90 degree rotation, with all rows summing to n.at n=14A156397
- Least j such that 6*p(j)*M(n)-1 is prime with p(j)=j-th prime and M(n) = Mersenne prime.at n=24A157333
- Triangle T(n,k) with the coefficient [x^k] of 1/(1-2*x-x^2+x^3)^(n-k+1) in row n, column k.at n=52A188106
- The number of (simultaneously) fixed and isolated points in the digraph representation of all functions f:{1,2,...,n}->{1,2,...,n}.at n=6A200248
- Triangular array read by rows: T(n,k) is the number of endofunctions f:{1,2,...,n}-> {1,2,...,n} whose largest component has exactly k nodes; n>=1, 1<=k<=n.at n=19A209324
- Triangle T(n,k), n>=0, 0<=k<=3n, read by rows: row n gives the coefficients of the chromatic polynomial of the complete tripartite graph K_(n,n,n), highest powers first.at n=16A212220
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..7 array extended with zeros and convolved with 1,2,1.at n=18A222126
- Triangular array read by rows: T(n,k) is the number of size k components in the digraph representation of all functions f:{1,2,...,n}->{1,2,...,n}; n>=1, 1<=k<=n.at n=19A225723
- Positions of peak values in A232221.at n=34A232359
- Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00001011.at n=8A261550
- Expansion of Product_{k>=0} 1/(1-x^(3*k+1))^3.at n=23A261631
- Numbers n such that Bernoulli number B_{n} has denominator 798.at n=39A272138
- Indices where records occur in A265432.at n=36A272675
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 9.at n=52A284782
- Expansion of 1/(1 - x*(1 + theta_3(x))/2), where theta_3() is the Jacobi theta function.at n=18A302018