6233
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6528
- Proper Divisor Sum (Aliquot Sum)
- 295
- 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
- 5940
- Möbius Function
- 1
- Radical
- 6233
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 62
- 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
- Diagonal sum of left-justified array T given by A027023.at n=24A027037
- Multiplicity of highest weight (or singular) vectors associated with character chi_55 of Monster module.at n=51A034443
- a(n) is the least odd number of the form p + k^2 with p prime and k > 0 which can be represented in exactly n different ways.at n=28A059400
- Harmonic mean of digits is 3.at n=41A062181
- Least number which may be expressed as the sum of a prime number and a nonzero square in exactly n different ways.at n=27A064283
- (-1)^(n+1)/2*sum(k=1,2n,C(2n+1,k)*B(k)*4^k) where C(n,k) are the binomial coefficients, B(k) the Bernoulli numbers.at n=3A069989
- Numbers k such that (15*10^(k-1) - 51)/9 is a plateau prime.at n=8A082700
- a(n) = number of primes of the form x^2 + 1 <= 2^n.at n=32A083847
- Right-truncatable semiprimes.at n=48A085733
- Poincaré series [or Poincare series] (or Molien series) for a certain six-fold wreath product P_6.at n=34A091769
- If n <= 1 then n else smallest number having in decimal representation exactly one common digit with its predecessor but none with its pre-predecessor.at n=37A107277
- Odd numbers n such that there exists a solution to lcm(s,z-s) = n, lcm(t,z-t) = n-2 and 0 < s+t < z < n.at n=24A108157
- Numbers k such that tau(k) = tau(k+1) mod 691, where tau is Ramanujan's tau function A000594.at n=7A121733
- A106486-encodings of combinatorial games equivalent to game {0|1}.at n=27A125997
- Ramanujan numbers (A000594) read mod 23^3.at n=11A126847
- a(n) = 29 + 73*n + 37*n^2.at n=12A145980
- Sequence S such that 1 is in S and if x is in S, then 6x-1 and 6x+1 are in S.at n=33A147993
- 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), (0, 1, -1), (0, 1, 1), (1, 0, 1), (1, 1, 1)}.at n=6A151227
- 1/2 the number of n X n arrays of squares of integers with every 2X2 subblock summing to 20.at n=9A159221
- a(n) = 4*n^2 + 4*n - 7.at n=38A166147