9514
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14688
- Proper Divisor Sum (Aliquot Sum)
- 5174
- 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
- 4620
- Möbius Function
- -1
- Radical
- 9514
- 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
- 78
- 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
- Numbers n such that n is a substring of its square (both n and n squared in base 4) (written in base 10).at n=25A018828
- Numbers k such that the continued fraction for sqrt(k) has period 76.at n=24A020415
- Fibonacci sequence beginning 2, 24.at n=14A022374
- Consider the trajectory of n under the iteration of a map which sends x to 3x - sigma(x) if this is >= 0; otherwise the iteration stops. The sequence gives values of n which eventually reach 0.at n=13A037159
- Numbers whose base-2 representation has exactly 12 runs.at n=15A043579
- Numbers which, when expressed as a sum of distinct primes with maximum product, use a non-maximal number of primes.at n=38A053020
- a(n) = 2*prime(n)*prime(n+1).at n=18A069486
- Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1, a(n+1)>a(n) and x=5/4.at n=45A080198
- a(1)=1, a(2)=2, a(3)=11, a(4)=19; a(n) = a(n-4) + sqrt(60*a(n-2)^2 + 60*a(n-2) + 1) for n >= 5.at n=9A103200
- Numbers k such that 60*k^2 + 60*k + 1 is a square.at n=10A105076
- a(n) = k*a(n-1) + a(n-2) where k = A003842(a); a(0) = 1.at n=15A108282
- Integers n such that 9*10^n + 11 is a prime number.at n=17A111023
- Expansion of 1/(1 - x^2 - 2 x^3 + x^4).at n=31A122512
- Even pseudoprimes to base 37.at n=17A130441
- Number of possible outcomes after n steps of the Zeno gambling process.at n=22A137414
- 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, -1, 0), (-1, 0, 0), (1, 1, 0), (1, 1, 1)}.at n=7A150902
- a(n) = a(n-1) + A073053(a(n-1)).at n=41A173578
- Number of nondecreasing arrangements of n+2 numbers in 0..5 with each number being the sum mod 6 of two others.at n=11A183908
- Number of (n+1)X(3+1) 0..2 arrays x(i,j) with row sums sum{x(i,j), j=1..3+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=1A233116
- T(n,k) = Number of (n+1) X (k+1) 0..2 arrays x(i,j) with row sums Sum_{j=1..k+1} x(i,j) nondecreasing, and column sums Sum_{i=1..n+1} i*x(i,j) nondecreasing.at n=7A233117