9286
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13932
- Proper Divisor Sum (Aliquot Sum)
- 4646
- 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
- 4642
- Möbius Function
- 1
- Radical
- 9286
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Base-7 Armstrong or narcissistic numbers (written in base 10).at n=19A010350
- a(n) = floor( exp(11/18)*n! ).at n=6A030880
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 96.at n=3A031594
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 72 ones.at n=7A031840
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=13A047826
- Becomes prime or 4 after exactly 9 iterations of f(x) = sum of prime factors of x.at n=3A048131
- a(n) is the number of distinct n-th powers of functions {1, 2, 3, 4, 5, 6} -> {1, 2, 3, 4, 5, 6}.at n=9A103950
- a(n) is the number of distinct n-th powers of functions {1, 2, 3, 4, 5, 6} -> {1, 2, 3, 4, 5, 6}.at n=21A103950
- a(n) is the number of distinct n-th powers of functions {1, 2, 3, 4, 5, 6} -> {1, 2, 3, 4, 5, 6}.at n=27A103950
- a(n) is the number of distinct n-th powers of functions {1, 2, 3, 4, 5, 6} -> {1, 2, 3, 4, 5, 6}.at n=33A103950
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having abscissa of the first return to the x-axis equal to 2k (1 <= k <= n).at n=36A129159
- Numbers k such that k and k^2 use only the digits 2, 6, 7, 8 and 9.at n=8A137118
- Base 7 perfect digital invariants (written in base 10): numbers equal to the sum of the k-th powers of their base-7 digits, for some k.at n=24A162228
- Greatest integer equal to the sum of the n-th powers of its base-7 digits (written in base 10).at n=5A162230
- Convolved with its aerated variant of two zeros between terms = A000041.at n=41A174068
- Number of 4 X n -1,1 arrays such that the sum over i=1..4,j=1..n of i*x(i,j) is zero and rows are nondecreasing (ways to put n thrusters pointing east or west at each of 4 positions 1..n distance from the hinge of a south-pointing gate without turning the gate).at n=32A225311
- Number of partitions p of n such that 2*(number of even numbers in p) = (number of odd numbers in p).at n=45A241653
- Number of Carlitz compositions of n with exactly six descents.at n=5A241696
- Number of endofunctions on [n] that are the 9th power of an endofunction.at n=6A247056
- Numbers n such that the decimal expansions of both n and n^2 have 2 as smallest digit and 9 as largest digit.at n=35A257485