9069
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 3027
- 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
- 6044
- Möbius Function
- 1
- Radical
- 9069
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 91
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Eight iterations of Reverse and Add are needed to reach a palindrome.at n=32A015988
- a(n) = T(n,n+1), where T is the array defined in A025564.at n=8A025567
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 52 ones.at n=19A031820
- Number of partitions of n into parts not of the form 25k, 25k+7 or 25k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=33A036006
- Denominators of continued fraction convergents to sqrt(851).at n=8A042643
- Determinant of n X n Hankel matrix whose entries are t(i+j), 0 <= i, j < n, where t is the Thue-Morse sequence.at n=36A056887
- Numbers k > 1 such that, in base 4, k and k^2 contain the same digits in the same proportion.at n=32A061658
- Numbers which need eight 'Reverse and Add' steps to reach a palindrome.at n=27A065213
- Numbers n such that phi(n + phi(n)) = sigma(n).at n=16A074874
- Duplicate of A074874.at n=16A074892
- A Graham-Pollak-like sequence with multiplier 3 instead of 2.at n=16A100671
- Number of tilings of a 4 X n rectangle using right trominoes and 2 X 2 tiles.at n=12A165799
- G.f.: A(x) = exp( Sum_{n>=1} [Sum_{k=0..n} C(n,k)^3 * x^k / A(x)^k] * x^n/n ).at n=11A198950
- Number of n X 4 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 4 array.at n=11A219350
- a(n) = a(n-1) + a(n-2) + 3*a(n-3) with a(0) = 1, a(1) = 2, a(2) = 5.at n=12A247594
- Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 4 6 or 7.at n=6A252517
- Number of (n+2)X(7+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 4 6 or 7.at n=1A252522
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 4 6 or 7.at n=29A252523
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 4 6 or 7.at n=34A252523
- Number of n X 2 nonnegative integer arrays with upper left 0 and lower right n+2-6 and value increasing by 0 or 1 with every step right or down.at n=9A252924