9333
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14508
- Proper Divisor Sum (Aliquot Sum)
- 5175
- 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
- 5760
- Möbius Function
- 0
- Radical
- 3111
- Omega Function (Ω)
- 4
- 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
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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(n) = n*(n + 1)*(n^2 - 3*n + 6)/8.at n=16A004255
- Coordination sequence for MgNi2, Position Ni3.at n=24A009934
- Numbers having three 3's in base 10.at n=35A043503
- Numbers with all odd digits, in which each digit divides the number formed by the rest, i.e., the number obtained by just removing this digit.at n=37A061507
- Numbers with at least 2 distinct digits and whose "rotations" (including the number itself) are multiples of these digits; repeated digits allowed but digit 0 not allowed.at n=11A066484
- a(1) = 4; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=43A074341
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 7.at n=6A094825
- Duplicate of A004255.at n=17A101357
- a(n) = 5*a(n-1) - 3*a(n-2), a(0)=1, a(1)=6.at n=6A109114
- a(n) = Sum_{k=1..phi(n)-1} t(n,k)*t(n,k+1), where t(n,k) is the k-th positive integer which is coprime to n and phi(n) is the number of positive integers which are <= n and are coprime to n.at n=34A119584
- Number of base 31 n-digit numbers with adjacent digits differing by three or less.at n=4A126499
- Monotonic ordering of set S generated by these rules: if x and y are in S then (x+1)(y+1) is in S, and 2 is in S.at n=38A192518
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x+511)^2 = y^2.at n=17A207078
- Number of partitions p of n such that 2(number of parts of p) - 2*min(p) is a part of p.at n=49A238588
- Number of "squares" (repeated identical blocks) in the n-th Fibonacci word.at n=16A248425
- Numbers k such that for each decimal digit d of k, "sum of all occurrences of d in k" is constant.at n=59A257054
- Coefficient of y^0 in G(x,y)^3 where G(x,y) = Sum_{n=-oo..+oo} (1-x^n)^n * x^n * y^n.at n=54A263188
- Numbers with digits 3 and 9 only.at n=22A284964
- Number of integer-sided pentagons having perimeter n, modulo rotations but not reflections.at n=33A293822
- Integers that concatenate 3 counts: the number of terms in the sequence so far, the number of primes in the sequence so far, the number of digits in the sequence so far, with a(1)= 113. The sequence is always extended with the smallest available integer not leading to a contradiction or a dead end.at n=8A309617