13275
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 24180
- Proper Divisor Sum (Aliquot Sum)
- 10905
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6960
- Möbius Function
- 0
- Radical
- 885
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence for sigma-CrFe, Position Xb.at n=29A009960
- Expansion of Product_{m>=1} (1+q^m)^(-25).at n=4A022620
- Sum of squares of the first n primes.at n=15A024450
- Odd composite numbers divisible by the sum of their prime factors (counted with multiplicity).at n=39A046347
- Numbers k such that 7*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=17A056720
- Nonprimes which terminate in their sum of prime factors.at n=40A071173
- Numbers k such that numerator of Bernoulli(2k) is divisible by the square of 59, the second irregular prime.at n=18A093058
- Sum of squares of the first n^2 primes = A024450[n^2].at n=3A122209
- a(n) = T(p(n)) - p(T(n)) = Commutator[triangular numbers, primes] at n.at n=46A123907
- Sum of the squares of the first 2^n primes.at n=4A131590
- Composite numbers n such that the sum of prime factors of n (counted with multiplicity) terminates n as a substring.at n=39A143993
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w<x+y.at n=29A182260
- Number of 4-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-bishop's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=18A187608
- a(n) is the sum over all proper integer partitions with distinct parts of n of the previous terms.at n=14A214952
- Triangle read by rows, 3^k*S_3(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.at n=17A225466
- Number of partitions of n having an ordering of parts in which no parts of equal parity are adjacent and the first and last terms have the same parity.at n=46A239833
- Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock summing to a nonzero multiple of 3.at n=3A251336
- Number of (n+1)X(4+1) 0..3 arrays with every 2X2 subblock summing to a nonzero multiple of 3.at n=0A251339
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to a nonzero multiple of 3.at n=6A251343
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to a nonzero multiple of 3.at n=9A251343