9306
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22464
- Proper Divisor Sum (Aliquot Sum)
- 13158
- 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
- 2760
- Möbius Function
- 0
- Radical
- 3102
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 153
- 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
- Tumbling distance for n-input mappings with 2 steps.at n=6A005947
- Pisot sequence T(7,10), a(n) = floor(a(n-1)^2/a(n-2)).at n=35A020752
- Composite numbers divisible by the palindromic sum of their prime factors (counted with multiplicity).at n=22A046358
- Composite a(n) divided by the palindromic sum of its prime factors is a palindrome (counted with multiplicity).at n=3A046361
- Sum of the reverses of the first n primes.at n=39A071602
- Pair the natural numbers such that the n-th pair is (k, k+p(n)) where k is the smallest number not occurring earlier and p(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the product of the members of every pair.at n=35A075316
- Sum of the first n primes whose indices are primes.at n=31A083186
- Expansion of (eta(q)^3*eta(q^10)^6)/(eta(q^2)^2*eta(q^5)^7) in powers of q.at n=42A113977
- Number of primes p < 10^n such that c - p is prime, where c is the next cube greater than p.at n=5A146759
- Records in A152968.at n=48A152973
- a(n) = Sum_{i=0..n} digsum_6(i)^3, where digsum_6(i) = A053827(i).at n=51A231674
- Expansion of f(-x, -x^5)^2 / f(x, x^3) in powers of x where f(, ) is Ramanujan's general theta function.at n=32A263041
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 355", based on the 5-celled von Neumann neighborhood.at n=23A271399
- Numbers k such that 3 is the smallest decimal digit of k^4.at n=27A291671
- Numbers m such that there are precisely 20 groups of order m.at n=30A298911
- Expansion of Product_{k>=1} ((1 + x^k)/(1 - x^k))^(sigma_0(k)).at n=13A301554
- k such that L(H(k,2)) = 2*L(H(k,1)) where L(x) is the number of terms in the continued fraction of x and H(k,r) = Sum_{u=1..k} 1/u^r.at n=39A336088
- Fixed points of A345352.at n=39A345362
- Numbers k for which A354102(k) = A354102(sigma(k)).at n=11A354106