1265
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1728
- Proper Divisor Sum (Aliquot Sum)
- 463
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 880
- Möbius Function
- -1
- Radical
- 1265
- Omega Function (Ω)
- 3
- 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
- 39
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Number of discordant permutations of length n.at n=7A000183
- Permanent of a certain cyclic n X n (0,1) matrix.at n=8A000804
- Odd squarefree numbers with an odd number of prime factors that have no prime factors greater than 31.at n=51A002556
- Number of rooted trees with n vertices in which vertices at the same level have the same degree.at n=42A003238
- Degrees of irreducible representations of Mathieu group M_24.at n=16A003859
- a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=1, a(2)=3.at n=34A004979
- Number of polyhedral graphs with n faces and minimal degree 4.at n=12A007024
- Coordination sequence T2 for Zeolite Code PAU.at n=26A008220
- Coordination sequence T3 for Zeolite Code PAU.at n=26A008221
- Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1.at n=32A008305
- Expansion of Product_{k>=1} (1 - x^k)^11.at n=23A010819
- Partial sums of primes, if 1 is regarded as a prime (as it was until quite recently, see A008578).at n=27A014284
- Numbers k that divide s(k), where s(1)=1, s(j)=25*s(j-1)+j.at n=50A014876
- Numbers whose sum of divisors is a cube.at n=18A020477
- a(n) = n*(21*n-1)/2.at n=11A022278
- Fibonacci sequence beginning 0, 23.at n=10A022357
- Number of partitions of n into parts of 5 kinds.at n=6A023004
- Numbers with exactly 3 0's in their base 5 expansion.at n=26A023724
- [ (3rd elementary symmetric function of 3,4,...,n+4)/(3+4+...+n+4) ].at n=9A024191
- Let c(k) denote the k-th composite number and p(k) the k-th prime number; then a(n) = Sum_{i=n*(n-1)/2+1 .. n*(n+1)/2} c(i) - Sum_{i=1..n} p(i).at n=12A024850