9263
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9480
- Proper Divisor Sum (Aliquot Sum)
- 217
- 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
- 9048
- Möbius Function
- 1
- Radical
- 9263
- Omega Function (Ω)
- 2
- 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
- 140
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- a(0) = 1, a(n) = 21*n^2 + 2 for n>0.at n=21A010011
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=30A020445
- a(n) = floor(exp(14/23) * n!).at n=7A030815
- a(n) = (n-1)*(n-2)*(n-3) + n.at n=22A034324
- Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5) <= cn(0,5).at n=12A036882
- Number of 2 X 2 singular integer matrices with elements from {0,...,n}.at n=34A059306
- a(n+1) = a(n)-th composite number, with a(1) = 11.at n=30A059407
- a(n) = n^3 + 2.at n=21A084380
- Number of chains in the power set lattice, or the number of fuzzy subsets of an (n+4)-element set X_(n+4) with specification n elements of one kind, 3 elements of another and 1 of yet another kind.at n=3A107954
- Numbers k such that 2^k, 3^k, 5^k, 7^k, 11^k, 13^k, 17^k and 19^k have even digit sum.at n=27A119897
- Number of 2 X 2 singular integer matrices with elements from {1,...,n}.at n=47A134506
- 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, 0), (-1, 1, 1), (0, 0, 1), (1, 0, 1), (1, 1, -1)}.at n=7A150576
- Integers of the form (k+1)*(2k+1)/12.at n=38A164578
- Numbers n such that the digits of sigma(n) are exactly the same (albeit in different order) as the digits of phi(n), in base 10.at n=17A175795
- a(n) = -1 + n + 4*n^2.at n=48A182868
- Semiprimes of the form n^3 + 2.at n=12A259189
- Expansion of f(-x^3)^3 / (f(-x^2) * f(-x^4)^2) in powers of x where f() is a Ramanujan theta function.at n=40A262150
- Numbers k such that 4 is the smallest decimal digit of k^3.at n=23A291643
- Partial sums of A299279.at n=15A299280
- a(n) = [x^(n^2)] (theta_3(x) - 1)^n/(2^n*(1 - x)), where theta_3() is the Jacobi theta function.at n=7A302995