9378
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20358
- Proper Divisor Sum (Aliquot Sum)
- 10980
- 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
- 3120
- Möbius Function
- 0
- Radical
- 3126
- 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
- yes
- Harshad Number
- no
- 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
- a(n) = floor(n*phi^13), where phi is the golden ratio, A001622.at n=18A004928
- a(n) = round(n*phi^13), where phi is the golden ratio, A001622.at n=18A004948
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite CAS = Cesium Aluminosilicate (Araki) Cs4[Al4Si20O48] starting with a T3 atom.at n=12A019090
- Least k>1 such that first n terms of Kolakoski sequence A000002 repeat in reverse order beginning at k-th term.at n=44A022295
- Least number of Sort-then-add persistence n.at n=29A033863
- Least number of Sort-then-add persistence n.at n=29A033908
- Base-5 palindromes that start with 3.at n=37A043008
- Numbers having four 2's in base 8.at n=16A043432
- Nearest integer to log(n!)^(1 + log(1 + log(n))).at n=21A062444
- Least k such that k*11^n +/- 1 are twin primes.at n=30A064220
- Numbers k such that Cyclotomic(k,k) (i.e., the value of k-th cyclotomic polynomial at k) is a prime number.at n=27A070519
- a(1)=1, a(n) is the smallest number >= a(n-1) such that the simple continued fraction for S(n) = 1/a(1) + 1/a(2) + ... + 1/a(n) contains exactly n elements.at n=36A071012
- Final terms of groups in A075631.at n=6A075634
- Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.at n=24A076425
- a(n) is the smallest nonprime k such that tau(k + n) = tau(k) + n , where tau(n) is the number of divisors of n (A000005).at n=29A099642
- Number of partitions of 2n in which odd parts and multiples of 3 and 5 occur with even multiplicities. There is no restriction on the other even parts.at n=24A102346
- G.f.: A(x) = exp( Sum_{n>=1} (4^n - 1)^n/3^(n-1) * x^n/n ), a power series in x with integer coefficients.at n=3A155210
- [s(k)-s(j)]/8, where the pairs (k,j) are given by A205867 and A205868, and s(k) denotes the (k+1)-st Fibonacci number.at n=39A205870
- Irregular triangle in which row n has numbers k such that prime(n) divides A001008(k), the numerator of the k-th harmonic number.at n=45A229493
- a(n) = Fibonacci(p) mod p^2, where p = prime(n).at n=29A236395