12165
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19488
- Proper Divisor Sum (Aliquot Sum)
- 7323
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6480
- Möbius Function
- -1
- Radical
- 12165
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 156
- 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
- a(n) = n*(27*n + 1)/2.at n=30A022285
- a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=1.at n=17A022311
- Consider all integer triples (i,j,k), j,k>0, with binomial(i+2, 3) = binomial(j+2, 3) + k^3, ordered by increasing i; sequence gives j values.at n=38A054222
- Integer quotients of partial sum of first n composite and n (see A053781).at n=13A073263
- a(n)=floor{square((1*n^0+1*n^1+2*n^2+4*n^3)/(1*n^0+2*n^1+1*n^2))}.at n=28A086863
- a(n) = 8*n^2 - 3.at n=38A108928
- Number of permutations of {1,2,...,n} containing exactly 4 occurrences of the 132 pattern.at n=4A138162
- a(n) = prime(n)^3 - 2.at n=8A153481
- Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 9, read by rows.at n=7A153654
- Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 9, read by rows.at n=8A153654
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2*j +3)*prime(j)*T(n-2, k-1) with j=9, read by rows.at n=7A153656
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2*j +3)*prime(j)*T(n-2, k-1) with j=9, read by rows.at n=8A153656
- Numbers n with following property: let c = nearest cube to n that is different from n and let p = nearest prime to n that is different from n. Then |n-c| = |n-p|.at n=21A163497
- Numbers k such that k^3 divides 14^(k^2) + 1.at n=17A177814
- Number of partitions of n where the difference between consecutive parts is at most 8.at n=35A238868
- Expansion of (1 - 2*x - sqrt(1-4*x))/(4*x^2 + sqrt(1-4*x)*(3*x+1) - 5*x + 1).at n=9A242781
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 105", based on the 5-celled von Neumann neighborhood.at n=26A270162
- Least k such that sigma(k*n)/tau(k*n) = sigma(k*n+1)/tau(k*n+1), or 0 if no such k exists.at n=21A274774
- Numbers k such that k^2 divides 14^k + 1.at n=10A292339
- Array read by antidiagonals: T(n,k) is the number of rooted strong triangulations of a disk with n interior nodes and 3+k nodes on the boundary.at n=41A341856