9453
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13248
- Proper Divisor Sum (Aliquot Sum)
- 3795
- 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
- 5984
- Möbius Function
- -1
- Radical
- 9453
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- yes
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- yes
- 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
- 60
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of x*(1+x-x^2)/((1-x)^4*(1+x)).at n=46A005744
- a(n) = prime(n)*(prime(n+1)-1)/2.at n=32A014303
- a(n) = (2*n+1)*(4*n+1).at n=34A014634
- Pseudoprimes to base 22.at n=43A020150
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor((n+1)/2).at n=44A024305
- a(n) = Sum_{k=0..floor((n-3)/2)} T(n,k) * T(n,k+3), with T given by A026022.at n=6A027297
- For n odd, >1, not divisible by 3, we can write 3/n = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest a.at n=44A027442
- Numbers in which all pairs of consecutive base-7 digits differ by 3.at n=36A033078
- Triangular numbers (A000217) with prime indices.at n=32A034953
- Odd triangular numbers with prime indices.at n=15A034954
- Numbers whose base-5 representation contains exactly three 0's and three 3's.at n=1A045202
- Sum of a(n) terms of 1/k^(3/4) first exceeds n.at n=36A056179
- a(n) = 25*n*(n + 1)/2 + 3.at n=27A061793
- Numbers n such that Fibonacci(n) is not squarefree, but for all proper divisors k of n, Fibonacci(k) is squarefree.at n=27A065069
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=18A066509
- Triangular numbers with sum of digits = 21.at n=10A068131
- Smallest triangular number with value of the internal digits = n; or 0 if no such number exists.at n=45A069692
- Triangular numbers with internal digits also forming a triangular number.at n=28A069702
- Number of ways to write the n-th prime as a sum of distinct primes.at n=48A070215
- Numbers n such that sum of primes dividing n (with repetition) is equal to the largest prime factor of n+1.at n=15A071863