8289
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
- 8
- Divisor Sum
- 12320
- Proper Divisor Sum (Aliquot Sum)
- 4031
- 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
- 5508
- Möbius Function
- 0
- Radical
- 921
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 114
- 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
- Lucky numbers that are decimal concatenations of n with n + 7.at n=10A032657
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+11 or 24k-11. Also number of partitions in which no odd part is repeated, with at most 5 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=45A036034
- Sizes of successive clusters in Z^4 lattice.at n=41A046895
- Numbers k such that gcd(k, reverse(k)) = 27 = 3^3, where reverse(x) = A004086(x).at n=28A072016
- Sum of numbers in n-th upward diagonal of triangle in A079826.at n=37A079825
- Number of positive integers <= 10^n that are divisible by no prime exceeding 13.at n=7A106629
- Triangle T, read by rows, equal to the matrix cube of triangle A113095, which satisfies the recurrence: A113095(n,k) = [A113095^4](n-1,k-1) + [A113095^4](n-1,k).at n=12A113099
- a(1) = 335; a(n) is the smallest k > a(n-1) such that k*A002110(n)^30 - 1 is prime.at n=36A119760
- a(n) = 3^n modulo Fibonacci(n).at n=23A128162
- a(n) = 6*n^2 - 10*n + 5.at n=37A136392
- Number of binary strings of length n with equal numbers of 00010 and 11011 substrings.at n=14A164226
- a(n) = smallest k such that A109671(k)=n, or -1 if n does not appear in A109671.at n=43A169741
- Sum of a positive square and a positive cube in at least three ways.at n=15A171385
- Smallest a(n) such that the prime factorization of a(n)! contains at least one factor to each exponent between 1 and n.at n=36A177442
- Numbers n such that Mordell's equation y^2 = x^3 + n has exactly 14 integral solutions.at n=8A179155
- Triangle read by rows: Pascal's triangle (A007318) times the Fibonacci triangle (A139375).at n=49A201165
- Number of nondecreasing arrays of n 0..n-1 integers with the sum of their 4th powers equal to sum(i^4,i=0..n-1).at n=16A216632
- a(n) = 8*n^2 + 3*n + 1.at n=32A236267
- a(n) = Sum_{k=1..n} floor(n/k)*2^(k-1).at n=12A268235
- Numbers k such that 5*10^k + 59 is prime.at n=23A276492