13750
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 28116
- Proper Divisor Sum (Aliquot Sum)
- 14366
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5000
- Möbius Function
- 0
- Radical
- 110
- Omega Function (Ω)
- 6
- 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
- 89
- 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
- First differences of A005579.at n=22A005347
- Numbers k such that S(k)=d(k), where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005).at n=15A073307
- Numbers n such that number of divisors of n divides S(n), the Kempner function A002034.at n=26A073413
- Number of collinear point 8-tuples in an n X n cubical grid.at n=11A178260
- a(n) = 22*n^2.at n=25A195323
- Numbers n such that the sum of prime factors of n (counted with repetition) equals three times the largest prime divisor.at n=39A212861
- Number of simple unlabeled graphs on n nodes with exactly 6 connected components that are trees or cycles.at n=13A215986
- Number of (n+1)X(n+1) 0..2 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock.at n=2A236010
- Number of (n+1)X(3+1) 0..2 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock.at n=2A236013
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the sum of the maximum and minimum values of each 2X2 subblock.at n=12A236018
- Number of partitions p of n such that 2*(number of even numbers in p) < (number of odd numbers in p).at n=44A241651
- Number of length 3+1 0..n arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=17A250420
- Expansion of 1/(1 - x - x^2 - x^3 + x^6 + x^7).at n=17A260917
- Prime factorization representation of Stern polynomials B(n,x) with only the even powers of x present: a(n) = A247503(A260443(n)).at n=55A284553
- Prime factorization representation of Stern polynomials B(n,x) with only the even powers of x present: a(n) = A247503(A260443(n)).at n=71A284553
- a(n) = A247503(A277324(n)).at n=27A284563
- a(n) = A247503(A277324(n)).at n=35A284563
- Primitive terms of A108569.at n=16A346277
- Numbers that are not a power of a prime but whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode.at n=35A363729