9022
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14616
- Proper Divisor Sum (Aliquot Sum)
- 5594
- 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
- 4152
- Möbius Function
- -1
- Radical
- 9022
- Omega Function (Ω)
- 3
- 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
- 153
- 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
- a(n) = n^2 written backwards.at n=46A002942
- Squares of 1 and primes, written backwards.at n=15A060998
- Number of incongruent ways to tile a 4 X n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.at n=54A068929
- n^2 read backwards, for n = 51, 50, 49, ..., 1.at n=4A080334
- Difference between the arithmetic mean of the neighbors of the terms and the term itself follows the pattern 0,1,2,3,4,5,...at n=31A086514
- Odd squares written backwards and sorted.at n=36A107313
- Number of (directed) Hamiltonian circuits on the n-antiprism graph.at n=10A124353
- Numbers k such that A127483(k) = A127483(k+1) - 1 = A127483(k+2) - 2.at n=30A127485
- Number of sequences of length n with elements {-2,-1,+1,+2}, such that the sum of elements of the whole sequence but of no proper subsequence equals 0 modulo n. For n>=4, the number of Hamiltonian (directed) circuits on the circulant graph C_n(1,2).at n=21A137725
- Collatz (or 3x+1) trajectory starting at 703.at n=17A161021
- a(n) = 6+32*n^2+8*n*(7+8*n^2)/3.at n=7A167498
- Number of nondecreasing arrangements of n+2 numbers in 0..8 with the last equal to 8 and each after the second equal to the sum of one or two of the preceding four.at n=19A189325
- Number of 0..n arrays x(0..3) of 4 elements with nondecreasing average value.at n=14A200764
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+x+y>=0.at n=13A211612
- The number of n-permutations that have a unique smallest cycle and this cycle contains the element 1.at n=7A224246
- Square array: A(row,col) = A003602(A254051(row,col)), read by antidiagonals A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...at n=74A254055
- Number of (n+2)X(n+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 2 and no row sum 0 and no column sum 3.at n=13A255793
- Least positive integer k such that prime(prime(k)), prime(prime(k*n)), prime(p) and prime(q) form a 4-term arithmetic progression for some pair of primes p and q.at n=45A261462
- Numbers with digit sum 13 that are multiples of 13.at n=35A283737
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) - n, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A296558