9282
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
- 4
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 14910
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2304
- Möbius Function
- -1
- Radical
- 9282
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = n OR n^3 (applied to ternary expansions).at n=20A008469
- T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A027157.at n=11A027165
- Inverse Euler transform of {1, primes}.at n=52A030011
- Convolution of natural numbers n >= 1 with Lucas numbers L(k)(A000032) for k >= 2.at n=13A033811
- a(n) = n^3 + n.at n=21A034262
- Products of successive Fibonacci numbers.at n=34A034722
- Products of exactly 5 distinct primes.at n=20A046387
- Golden rectangular box numbers: a(n) = n*A007067(n)*A007067(A007067(n)).at n=13A050510
- Numbers that are divisible by exactly 5 different primes.at n=28A051270
- (Terms in A028273)/2.at n=44A051298
- (Terms in A014476)/2.at n=40A051497
- Number of partitions of the n-th prime into parts that are all primes.at n=21A056768
- Numbers k > 1 such that, in base 4, k and k^2 contain the same digits in the same proportion.at n=33A061658
- Product of three consecutive Fibonacci numbers.at n=6A065563
- Integers which have at least two different factorizations into coprime parts whose sum are equal.at n=39A069064
- Square root of sum of successive primes in n-th group in A077280.at n=6A077281
- Write n as Product_{i=1..k} prime(i)^e_i, where prime(i) is the i-th prime number and e_i is a nonnegative integer. a(n) = Sum_{i=1..k} e_i*n^(i-1).at n=20A090883
- a(n) = n^3+n for odd n, (n^3+n)*3/2 for even n: Row sums of A093915.at n=20A093917
- Sum[k=1..n, T(k,n-k+1)], where T is array A094718.at n=17A094719
- a(n) = A019565(n-th prime).at n=27A109163