13114
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
- 8
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 7046
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6396
- Möbius Function
- -1
- Radical
- 13114
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 107
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*(1-x^4)).at n=47A002621
- Numbers n such that phi(n + 1) | sigma(n) for n congruent to 1 (mod 3).at n=32A015817
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049723.at n=28A049726
- Numbers k such that sigma(k) = 2*phi(k+1).at n=16A068423
- a(n) = 2*prime(n)*prime(n+1).at n=21A069486
- a(n) = (27*n^2 + 9*n + 2)/2.at n=31A093485
- Number of (n+1) X 2 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors.at n=16A206260
- G.f. satisfies: A(x) = Sum_{n>=0} x^n * Product_{k=0..n-1} A(u(n)^k*x), where u(n) = exp(2*Pi*I/n) is an n-th root of unity.at n=15A206725
- a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 1] as of [1, 2, 1].at n=9A211283
- Total number of parts in all partitions of n with at least one distinct part.at n=23A220477
- Sum of numbers in the n-th antidiagonal of the reciprocity array of 2.at n=37A259580
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 150", based on the 5-celled von Neumann neighborhood.at n=36A270323
- Centered triangular numbers which are products of three distinct primes.at n=11A359624
- Square array of distinct positive integers A(n, k), n, k > 0, read and filled the greedy way by antidiagonals downwards such that the concatenations of the terms of two distinct rows are always equal.at n=41A363932
- a(1) = 12; for n >= 2, a(n) = least positive integer of the form prime(m)*prime(n-m)*prime(n) with m >= 1.at n=22A364434