1461
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1952
- Proper Divisor Sum (Aliquot Sum)
- 491
- 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
- 972
- Möbius Function
- 1
- Radical
- 1461
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 96
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^3)).at n=34A000601
- Expansion of 1/((1+x)*(1-x)^10).at n=5A001781
- Number of solutions to a linear inequality.at n=34A002797
- Numbers that are the sum of 5 positive 6th powers.at n=11A003361
- Numbers that are the sum of at most 5 nonzero 6th powers.at n=39A004856
- Numbers k such that 10*3^k - 1 is prime.at n=34A005542
- Coordination sequence T4 for Zeolite Code DOH.at n=24A008081
- Coordination sequence T6 for Zeolite Code EUO.at n=24A008101
- Coordination sequence T3 for Zeolite Code DFO.at n=29A009877
- a(n) = floor(n*(n-1)*(n-2)/15).at n=29A011897
- Continued fraction for log(26).at n=10A016454
- Numbers k such that the continued fraction for sqrt(k) has period 38.at n=7A020377
- Ternary expansion uses each positive digit just once.at n=37A023741
- Number of partitions of n into prime power parts (1 excluded).at n=38A023894
- Index of 10^n within the sequence of the numbers of the form 2^i*10^j.at n=29A025740
- a(n) = dot_product(1,2,...,n)*(7,8,...,n,1,2,3,4,5,6).at n=11A026049
- Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1 <= k <= n-1, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if n is even and 1 <= k <= n/2, else T(n,k) = T(n-1,k-1) + T(n-1,k).at n=71A026747
- a(n) = T(2n-1,n-1), T given by A026747.at n=5A026751
- a(n) = T(n, floor(n/2)), T given by A026747.at n=11A026753
- a(n) = greatest number in row n of array T given by A026747.at n=11A027222