9922
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16758
- Proper Divisor Sum (Aliquot Sum)
- 6836
- 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
- 4400
- Möbius Function
- 0
- Radical
- 902
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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
- Number of partitions of 3n-1 into n nonnegative integers each no more than 6.at n=23A001978
- a(n) = Fibonacci(n+1) - 2^floor(n/2).at n=20A005672
- a(n) = Fibonacci(n) - 2^(floor(n/2)).at n=21A028892
- Triangular array associated with Schroeder numbers.at n=50A033878
- Number of points of L1 norm 4 in cubic lattice Z^n.at n=11A035598
- Coordination sequence for 11-dimensional cubic lattice.at n=4A035706
- Coordination sequence for C_11 lattice.at n=2A035748
- Number of partitions of n into parts not of form 4k+2, 16k, 16k+5 or 16k-5.at n=53A036022
- Numbers whose base-3 representation contains no 0's and exactly one 2.at n=40A044990
- Number of rooted identity trees with n nodes and 3 leaves.at n=23A055328
- Numbers k such that 5*2^k + 3 is prime.at n=47A058586
- a(n) = (n^3 + 5*n + 18)/6.at n=41A060163
- Dot product of the squares and the quarter-squares: a(n) = sum(i=1..n, i^2 * floor(i^2/4)).at n=10A060453
- Number of nodes in virtual, "optimal", chordal graphs of diameter 4 and degree n+1.at n=19A067956
- Treated as strings, n begins with Floor(sqrt(n)).at n=45A069086
- Numbers in A070938 that set a new record for digital sums and ending digits.at n=14A070594
- a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base-ten digits of n, or 0 if no such a(n) exists.at n=21A075154
- Numbers n such that sopf(phi(n)) = phi(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.at n=32A076531
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and height k (1 <= k <= n).at n=57A080936
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 82.at n=3A093282