13876
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 24290
- Proper Divisor Sum (Aliquot Sum)
- 10414
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6936
- Möbius Function
- 0
- Radical
- 6938
- Omega Function (Ω)
- 3
- 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
- 32
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = Sum_{m=1..n} Sum_{k=1..m} prime(k).at n=28A014148
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 88 ones.at n=8A031856
- a(n) = a(n-1) + a(round(2*(n-1)/3)) + a(round((n-1)/3)) with a(1)=1, a(2)=2.at n=34A033500
- a(n) = 10*n^2 + 5*n + 1.at n=37A080860
- A014486-encoding of symmetric binary trees.at n=6A083941
- Coordination sequence for octagonal tiling is a(n)*sqrt(2) + A103909(n).at n=37A103908
- Nearest integer to 1/frac(Pi^A137994(n)), where frac(x) = x - floor(x).at n=10A137995
- Euler transform of powers of 5.at n=5A144069
- Number A(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=60A144074
- Greatest number m such that the fractional part of Pi^A137994(n) <= 1/m.at n=10A153713
- Greatest number m such that the fractional part of Pi^A153710(n) <= 1/m.at n=12A153714
- Total area of the largest inscribed rectangles of all integer partitions of n.at n=22A182099
- Number of 0..n arrays x(0..6) of 7 elements with zero 4th differences.at n=30A200274
- Number of n X n 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=4A207236
- Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=4A207239
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=40A207242
- Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=4A207245
- Number of partitions of n such that 2*(number of distinct parts) = number of parts.at n=49A239959
- Number of multisets of nonempty words with a total of n letters over n-ary alphabet.at n=5A252654
- Strings of 5 digits from 1...9, such that no formula using the single digits in the given order exists that evaluates to 0.at n=11A288355