9338
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 7942
- 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
- 3696
- Möbius Function
- 1
- Radical
- 9338
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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) = round(n*phi^12), where phi is the golden ratio, A001622.at n=29A004947
- a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.at n=29A004967
- Numbers k such that sigma(k) = sigma(k+7).at n=15A015867
- Numbers whose set of base-13 digits is {3,4}.at n=23A032837
- Number of partitions of n into parts not of the form 23k, 23k+4 or 23k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=35A035992
- Starting positions of strings of three 8's in the decimal expansion of Pi.at n=6A083637
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 1, 0), (1, 0, 0), (1, 1, -1)}.at n=8A149941
- a(n) = 225*n^2 - 251*n + 70.at n=7A156810
- Numbers n such that the sum of the squares of the digits of n^n is a square.at n=14A171976
- 0-sequence of reduction of (2n) by x^2 -> x+1.at n=13A192305
- 23 times triangular numbers.at n=28A195039
- Number of (n+2) X 5 binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=4A202456
- Number of (n+2) X 7 binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=2A202458
- T(n,k)=Number of (n+2)X(k+2) binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=23A202461
- T(n,k)=Number of (n+2)X(k+2) binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=25A202461
- Number of nX4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=4A208365
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=32A208369
- Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=3A208371
- Number of arrays of n nonnegative integers with value i>0 appearing only after i-1 has appeared at least 6 times.at n=17A210543
- Numbers n for which phi(n) = phi(n-1) - phi(n+1).at n=2A220160