9222
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19440
- Proper Divisor Sum (Aliquot Sum)
- 10218
- 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
- 2912
- Möbius Function
- 1
- Radical
- 9222
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 109
- 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
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite AET = AlPO4-8 [Al36P36O144] starting with a T4 atom.at n=5A018947
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=26A024600
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 32.at n=5A031710
- Numbers having three 2's in base 10.at n=35A043499
- Number of triangular regions in regular n-gon with all diagonals drawn.at n=26A062361
- a(n) = Sum_{d|n} sigma(n*d).at n=35A069546
- Numbers in base 10 that are palindromic in bases 4 and 5.at n=5A097929
- Numbers n such that 4*10^n + 3*R_n + 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=25A102989
- a(1) = 932; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=22A105213
- If n <= 1 then n else smallest number having in decimal representation exactly one common digit with its predecessor but none with its pre-predecessor.at n=44A107277
- Largest number k for which the n-th prime is the median of the largest prime dividing the first k integers.at n=41A126283
- Start with i=1 and j=2. Concatenate i and j, get k = floor(ij/j), concatenate j and k, etc.at n=19A127320
- Composite numbers that are products of distinct primes and divisible by the sum of those primes.at n=28A131647
- a(n) = a(n-1) + Sum_{k=0..floor(log_2(n-1))} a(2^k), a(1) = 1.at n=29A133147
- Numbers k such that A136677(k) is prime.at n=8A136686
- Approximate prime counts at 10^n resulting from an experimental algorithm designed to estimate with 99+% accuracy unknown values of 10^n.at n=3A141306
- Convolution square of A003106.at n=39A145468
- a(n) = 36*n^2 + 6.at n=15A158479
- 6n-1,6n+1, 6n+5, 6n+7 are all primes. That is they are adjacent pairs of twin primes.at n=26A178145
- Number of length n+2 0..5 arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=10A248430