12313
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14080
- Proper Divisor Sum (Aliquot Sum)
- 1767
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10548
- Möbius Function
- 1
- Radical
- 12313
- 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
- 112
- 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
- Number of partitions of n with positive rank.at n=37A064173
- Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row.at n=24A095182
- 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, 1), (0, 1, -1), (0, 1, 1), (1, 0, 1), (1, 1, -1)}.at n=7A150758
- a(n) = 324*n + 1.at n=37A158272
- a(n) = 38*n^2 + 1.at n=18A158593
- a(n) = 8*n^2 + 20*n + 1.at n=38A161617
- Odd composite numbers n, such that n, n+d, n*d and n/d are all odious (A000069) for every divisor d of n.at n=25A231558
- Perimeter (rounded down) of Pi-shaped box fractal after n iterations.at n=10A242823
- Number T(n,k) of ways k L-tiles can be placed on an n X n square; triangle T(n,k), n>=0, 0<=k<=A229093(n), read by rows.at n=39A243608
- Numbers k such that k + (sum of digits of k) and k + (product of digits of k) contain the same distinct digits of k.at n=7A248718
- Zeroless numbers n with digits d_1, d_2, ... d_k such that d_1^3 + ... + d_k^3 is a cube.at n=37A254960
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 299", based on the 5-celled von Neumann neighborhood.at n=25A271154
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 302", based on the 5-celled von Neumann neighborhood.at n=33A271158
- a(n) = 21*n^2 - 33*n + 13.at n=24A289134
- a(1) = 1; a(n+1) is the smallest k > a(n) such that 2^k == 2^a(n) (mod a(n)).at n=41A306829
- Number of permutations of [n] whose cycle lengths avoid squares.at n=8A329945
- a(n) = Sum_{k=3..n} binomial(k-1,2) * floor(n/k).at n=40A366970
- Triangle read by rows: T(n,k) is the number of derangements in S_n with no k-cycles. 1 <= k <= n.at n=31A378495