11460
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 32256
- Proper Divisor Sum (Aliquot Sum)
- 20796
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3040
- Möbius Function
- 0
- Radical
- 5730
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 29
- 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
- Number of 5-leaf rooted trees with n levels.at n=14A007715
- Expansion of 1/(1-x^3-x^4-x^5).at n=38A017818
- Self-convolution of 1 2 3 5 7 11 15 22 30 42 56 77 ... (A000041).at n=16A048574
- Number of partitions of 2n whose Ferrers-Young diagram allows more than one different domino tiling.at n=18A052837
- Closed 3-dimensional ball numbers (version 2): a(n)= number of integer points (i,j,k) contained in a closed ball of diameter n, centered at (1/2,0,0).at n=28A053593
- Open 3-dimensional ball numbers (version 2): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2,0,0).at n=28A053594
- a(n) = A064842(n)/2.at n=40A064843
- Sum of digits of numbers between 0 and (8/9)*(10^n-1).at n=3A089909
- Odd triangle !n. This table read by rows gives the coefficients of sum formulas of n-th Left factorials (A003422). The k-th row (6>=k>=1) contains T(i,k) for i=1 to k+1, where k=[2*n+3+(-1)^n]/4 and T(i,k) satisfies !n = Sum_{i=1..k+1} T(i,k) * n^(i-1) / (2*k-2)!.at n=12A102412
- a(n) = n-th prime * n-th nonprime.at n=42A127118
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=7.at n=38A135192
- Numbers k such that k and k^2 use only the digits 0, 1, 3, 4 and 6.at n=16A136838
- Expansion of 1 / (1 - x - x^3 + x^6) in powers of x.at n=33A193771
- Number of different figures obtained by a putting two Young diagrams of partitions lambda and mu, such that |lambda| + |mu| = n on top of each other.at n=26A225751
- The number of all possible covers of L-length line segment by 3-length line segments with allowed gaps < 3.at n=35A228362
- Number of proper colorings of the cube with at most n colors under rotational symmetry.at n=10A249460
- a(n) = (n + 1)*(4*n^2 + 14*n + 9)/3.at n=19A268484
- Numbers k such that (22*10^k - 19)/3 is prime.at n=21A282139
- Numbers k such that (14*10^k - 101)/3 is prime.at n=16A284886
- Number of n X n 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=4A299808