13871
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16464
- Proper Divisor Sum (Aliquot Sum)
- 2593
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11520
- Möbius Function
- -1
- Radical
- 13871
- 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
- 182
- 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
- a(n) is the position of cube of the n-th prime among the powers of primes (A000961).at n=15A024625
- Positions of cubes among the powers of primes (A000961).at n=24A024627
- a(n) = T(2n-1,n), where T is the array defined in A024996.at n=6A026072
- Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5) + cn(2,5) and cn(0,5) < cn(1,5) + cn(4,5) + cn(3,5).at n=34A039846
- Distinct numbers in writing first numerator and then denominator of 1/2-Pascal triangle (by row).at n=54A046220
- First numerator and then denominator of elements to right of central elements of 1/2-Pascal triangle (by row), excluding 1's and 2's.at n=49A046228
- Number of nonempty subsets of {1,2,...,n} in which exactly 2/3 of the elements are <= sqrt(n).at n=38A048095
- a(n) = 48*n^2 - 1.at n=17A065532
- Start of a record-breaking run of consecutive integers with an odd number of prime factors.at n=8A066794
- a(n) = (1/n!)*A001565(n).at n=23A094792
- Expansion of 1/((1-x^2)*sqrt(1-4*x)).at n=8A106188
- a(n) = 12*n^2 - 1.at n=34A158463
- a(n) is the smallest k such that the n consecutive values L(k), L(k+1), ..., L(k+n-1) = -1, where L(m) is the Liouville function A008836(m).at n=11A175202
- a(n) is the smallest k such that the n consecutive values L(k), L(k+1), ..., L(k+n-1) = -1, where L(m) is the Liouville function A008836(m).at n=12A175202
- a(n) is the smallest k such that the n consecutive values L(k), L(k+1), ..., L(k+n-1) = -1, where L(m) is the Liouville function A008836(m).at n=13A175202
- Number of 0..n arrays x(0..5) of 6 elements with zero 5th difference.at n=9A200157
- Start of record runs with lambda(k) = lambda(k+1) = ..., where lambda is Liouville's function A008836.at n=8A233445
- Number of partitions p of n such that 2(number of parts of p) - min(p) is a part of p.at n=53A238587
- First occurrence of a run of exactly n consecutive integers with an odd number of prime factors.at n=13A275509
- Partial sums of A299287.at n=17A299288