13250
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25272
- Proper Divisor Sum (Aliquot Sum)
- 12022
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5200
- Möbius Function
- 0
- Radical
- 530
- Omega Function (Ω)
- 5
- 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
- 76
- 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
- Numbers that are the sum of 7 positive 7th powers.at n=34A003374
- a(0) = 1, a(n) = 23*n^2 + 2 for n>0.at n=24A010013
- Character of extremal vertex operator algebra of rank 15/2.at n=4A028533
- Triangle of coefficients of polynomials arising in enumeration of periodic sequences.at n=62A054722
- Number of n-bead necklace structures using exactly four different colored beads.at n=10A056297
- Number of primitive (period n) n-bead necklace structures using exactly four different colored beads.at n=10A056305
- Numbers n such that n | 4^n + 3^n + 2^n + 1^n.at n=27A056643
- Array described in A062704 read by diagonals in direction of creation.at n=41A062705
- The array of A062704 read by diagonals in the 'up' direction.at n=39A062706
- Number of fixed points under n-fold inflation for the substitution rule a->abc, b->ab, c->b that underlies the Kolakoski (3,1) sequence.at n=11A080204
- Numbers n that are the hypotenuse of exactly 10 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 10 ways.at n=26A097225
- Number of (n,4) Freiman-Wyner sequences.at n=10A097926
- Triangle read by rows: T(n, k) is the number of primitive (period n) n-bead necklace structures with k different colors. Only includes structures that contain all k colors.at n=58A107424
- Numbers k such that the k-th triangular number contains only digits {5,7,8}.at n=10A119225
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (1, 1, -1), (1, 1, 0), (1, 1, 1)}.at n=7A150931
- Triangle read by rows: T(n,k) is the number of k-block partitions of an n-set up to rotations.at n=58A152175
- a(n) = n*A007504(n)/2 = n*(sum of first n primes)/2.at n=25A156778
- Table with T(n,k) the number of word structures of length n which can be decomposed into k palindromes but not fewer.at n=48A188792
- Number of standardized 4-connected side polyominoes of inner site-perimeter n.at n=9A216821
- Number of bipartitions of n wherein odd parts are distinct (and even parts are unrestricted).at n=24A273225