8469
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12246
- Proper Divisor Sum (Aliquot Sum)
- 3777
- 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
- 5640
- Möbius Function
- 0
- Radical
- 2823
- Omega Function (Ω)
- 3
- 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
- 34
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that k | 12^k + 11^k + 1.at n=27A057293
- Numbers n such that [A070080(n), A070081(n), A070082(n)] is an obtuse isosceles integer triangle with prime side lengths.at n=17A070135
- Numbers n whose sum of divisors and number of divisors are both triangular numbers.at n=28A070996
- Positions of sevens (ground states) in A084451.at n=18A084449
- Number of planar polyhexes (A000228) with at most n cells.at n=8A131467
- 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, 0, 1), (-1, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150702
- a(n) = 242*n - 1.at n=34A157961
- a(n) = 70*n^2 - 1.at n=10A158736
- Transform of the finite sequence (1, 0, -1) by the T_{1,1} transformation (see link).at n=10A159329
- a(n) = largest number k such that k and k * n taken together have distinct digits, or 0 if no such k exists.at n=14A173780
- Averages of four consecutive odd squares.at n=44A173960
- Number of symmetry classes of reduced 3 X 3 magilatin squares with largest entry n.at n=46A174019
- a(n) = smallest composite (odd) number greater than a(n-1) such that a(n)+2n is the first prime after a(n).at n=15A189118
- Number of n X n 0..3 arrays with new values 0..3 introduced in row major order and no element equal to more than one of its immediate leftward or upward neighbors.at n=2A208169
- Number of n X 3 0..3 arrays with new values 0..3 introduced in row major order and no element equal to more than one of its immediate leftward or upward neighbors.at n=2A208170
- T(n,k)=Number of nXk 0..3 arrays with new values 0..3 introduced in row major order and no element equal to more than one of its immediate leftward or upward neighbors.at n=12A208175
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+2x+3y>1.at n=13A211622
- a(0)=1, a(n) = least k > a(n-1) such that k*a(n-1) is a triangular number.at n=22A213005
- a(n) = n*(9*n + 25)/2 + 6.at n=42A235332
- Numbers m with C(2*m, m) - prime(m) prime, where C(2*m, m) = (2*m)!/(m!)^2.at n=29A236248