12383
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 2497
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10080
- Möbius Function
- -1
- Radical
- 12383
- 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
- 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
- 169
- 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
- Number of n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951).at n=38A001522
- a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n^2 + 5)/6.at n=42A004006
- a(n) = 1 + Sum_{i=1..n} phi(i)^2.at n=43A049454
- Number of 3-element antichains on an unlabeled n-element set; equivalence classes of monotone Boolean functions of n variables with 3 mincuts under action of symmetric group S_n.at n=14A056778
- Expansion of (1+2*x+4*x^2+8*x^3)/(1-x-16*x^5).at n=13A098582
- 3-almost primes that are the sum of 2 positive cubes. Sums of 2 positive cubes, with the sums having exactly 3 prime divisors counted with multiplicity.at n=39A122732
- Indices k such that k divides A007468(k).at n=22A134244
- Minimal natural number (in decimal representation) with n prime substrings in base-3 representation (substrings with leading zeros are considered to be nonprime).at n=23A217303
- Numbers which are the sum of two positive cubes and divisible by 29.at n=8A224483
- a(n) = (9*n^3 + 5*n)/2.at n=13A230018
- a(n) = 10^(prime(n)-1) mod prime(n)^2.at n=35A265012
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 99", based on the 5-celled von Neumann neighborhood.at n=26A270158
- Values of a^3 + b^3 such that the equation a^3 + b^3 = x^2 + y^2 + z^2 is not soluble where a, b > 0 and x, y, z >= 0.at n=29A272174
- a(n) = A000110(n) * A000111(n). The exponential limit of sec + tan. Row sums of A373428.at n=6A320956
- a(n) = A351477(n) * FC where F is the Fermat point of a primitive integer-sided triangle ABC with A < B < C < 2*Pi/3 and FA + FB + FC = A336329(n).at n=40A351803
- a(n) = number of k-tuples (u(1), u(2), ..., u(k)) with 1 <= u(1) < u(2) < ... < u(k) <= n such that u(i) - u(i-1) <= 4 for i = 2,...,k.at n=13A356620
- a(n) = [x^(n^4)] Product_{k=1..n} (x^(k^4) + 1 + 1/x^(k^4)).at n=20A369517