8303
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 9144
- Proper Divisor Sum (Aliquot Sum)
- 841
- 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
- 7524
- Möbius Function
- 0
- Radical
- 437
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 127
- 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
- a(1)=1; for n>1, a(n) = 9*a(n-1) + n.at n=4A014832
- a(n) = (2*n - 15)*n^2.at n=19A015247
- (s(n)+s(n+1))/18, where s()=A006521.at n=20A016060
- Products p^3 or p^2*q, where {p,q} are consecutive primes.at n=22A033477
- Take the first n numbers written in base 9, concatenate them, then convert from base 9 to base 10.at n=4A048441
- Number of independent sets of vertices in P_3 X C_n (n > 2).at n=7A050400
- The first n digits of the juxtaposition of the base 9 numbers converted to decimal.at n=4A055150
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n.at n=27A057257
- a(n) = floor(n^4/64).at n=27A060494
- Let x = 1.757739951145463... be smallest real number that satisfies gcd(floor(x^m),m)=1 for all integers m>0; sequence gives floor(x^n).at n=15A069818
- Numbers k such that 2^k - k^2 is prime.at n=23A072180
- Smallest multiple of n beginning with the n-th prime.at n=22A078208
- a(n) is the number of subsets of {1,...,n} containing no solutions to x+y=z with x and y distinct (one version of "sum-free subsets").at n=18A085489
- Number of partitions of n into nonsquares.at n=49A087153
- a(n) = floor(9^n/2^n).at n=6A094971
- Eigenvector of triangle A124428.at n=13A124430
- Numbers k such that k and k^2 use only the digits 0, 3, 6, 8 and 9.at n=23A136945
- Number of graphs with n vertices that have an even determinant for the adjacency matrix.at n=7A140981
- Numbers having exactly two distinct prime factors p, q with q = p+4.at n=26A143203
- a(n) = 29 + 73*n + 37*n^2.at n=14A145980