13188
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 35392
- Proper Divisor Sum (Aliquot Sum)
- 22204
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3744
- Möbius Function
- 0
- Radical
- 6594
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 125
- 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
- Representation degeneracies for boson strings.at n=41A005290
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 76.at n=28A031574
- Greatest number m with A088444(m) = n.at n=27A088448
- Numbers n such that 9*10^n + 8*R_n - 1 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=15A103109
- Number of partitions of n into parts that are odd or == +- 2 (mod 10).at n=43A133153
- Table where row n lists the coefficients in the (2^n)-th iteration of x+x^2 for n>=0, read by antidiagonals not including trailing zeros in rows.at n=32A158264
- Number of (n+2) X 5 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=17A190027
- Number of partitions p of n such that median(p) = multiplicity(max(p)).at n=42A240209
- Number of tilings of a 10 X n rectangle using 2n pentominoes of shape I.at n=17A247117
- Number of (n+2)X(2+2) 0..1 arrays with every 3X3 subblock diagonal median plus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=1A253987
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal median plus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=4A253993
- Number of (2+2)X(n+2) 0..1 arrays with every 3X3 subblock diagonal median plus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=1A253994
- Triangle read by rows: T(m,n) (m >= n >= 1) = number of regions formed by drawing the line segments connecting any two of the (m+1) X (n+1) lattice points in an m X n grid of squares and extending them to the boundary of the grid.at n=18A333282
- Numbers that are the sum of eight fourth powers in seven or more ways.at n=17A345582
- Numbers that are the sum of eight fourth powers in exactly seven ways.at n=17A345839
- Positions of -2's in A346242.at n=45A354822
- The smallest number in base n such that two digits (and no fewer) need to be changed to get a prime.at n=26A370531
- Expansion of 1/(2 - (1 + 4*x)^(3/2)).at n=5A373715
- Expansion of e.g.f. 1 / (1 + 3 * x * log(1 - x))^(2/3).at n=6A375689