13850
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25854
- Proper Divisor Sum (Aliquot Sum)
- 12004
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5520
- Möbius Function
- 0
- Radical
- 2770
- Omega Function (Ω)
- 4
- 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
- 151
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_131 of Monster module.at n=39A034519
- Number of (s,2) gates.at n=12A037294
- Numbers k such that k^8 == 1 (mod 9^3).at n=37A056084
- Zero, together with positive numbers k such that prime(k) - k is a square.at n=40A064370
- floor((log(4)/log(3))^n).at n=41A140881
- a(n) = 729*n - 1.at n=18A158395
- Expansion of 1/(1 - x - x^8 - x^15 + x^16).at n=49A173925
- (A178476(n)-3)/9.at n=11A178486
- Numbers n such that 3 and 5 do not divide swing(n) = A056040(n).at n=43A196748
- Number of (n+1)X2 0..3 arrays with every row and column least squares fitting to a positive slope straight line.at n=4A222925
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every row and column least squares fitting to a positive slope straight line.at n=10A222929
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every row and column least squares fitting to a positive slope straight line.at n=14A222929
- T(n,k)=Number of nX(k+1) 0..2 arrays with every row least squares fitting to a positive slope straight line and every column least squares fitting to a zero or positive slope straight line, with a single point array taken as having zero slope.at n=16A223309
- a(n) = n*(n^2 - 3*n + 4).at n=25A242659
- Number of n X n 0..1 arrays with every element equal to 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A299833
- Number of nX4 0..1 arrays with every element equal to 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A299835
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=24A299839
- Expansion of (1/(1 + x)) * Product_{k>=1} (1 + k*x^k/(1 + x)^k).at n=13A307260
- Number of perfect-powers x in the range 2^n <= x < 2^(n+1).at n=30A377435