9413
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9414
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 9412
- Möbius Function
- -1
- Radical
- 9413
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 34
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1164
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of form k^2 + 4.at n=20A005473
- Primes of the form p^2 + 4, where p is prime.at n=9A045637
- Bessel function Y_0(n) is a monotonically decreasing positive sequence.at n=21A046961
- Bessel function |Y_0(n)| is a monotonically decreasing positive sequence.at n=36A046963
- Numbers k such that the digits of k^3 occur with the same frequency.at n=54A052047
- Numbers k such that k^3 is a cube whose digits occur with an equal minimum frequency of 2.at n=13A052051
- T(2*n,n), array T as in A054110.at n=7A054113
- Smallest prime larger than square of n-th prime.at n=24A062772
- Primes which are the concatenation of numbers n_1, n_2, n_3, in that order, with n_1 + n_2 = n_3 (leading zeros are forbidden for nonzero n_i).at n=9A067860
- Prime(n) and prime(n+3) use the same digits.at n=9A069795
- Group the composite numbers so that the sum of each group is a prime; sequence gives sum of terms in each group.at n=45A073686
- Least m such that A078142(m) gives the n-th prime, where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.at n=42A073939
- Primes which are sandwiched between two numbers having the same unordered canonical form.at n=26A074460
- Primes in which the digit string can be partitioned into three parts such that the sum of the first two is equal to the third, and the second part is nonzero.at n=8A088291
- Duplicate of A045637.at n=9A094481
- Primes p such that primorial(p)/2 - 2 is prime.at n=23A096547
- Primes of the form n^2 + 4n + 8.at n=19A098062
- Indices of primes in sequence defined by A(0) = 83, A(n) = 10*A(n-1) + 43 for n > 0.at n=7A101077
- Smallest prime a(n) such that concatenation of first n+1 primes starting from a(n), separated by n zeros, is prime.at n=25A102109
- Primes from merging of 4 successive digits in decimal expansion of (Pi^2).at n=26A104927