12265
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16128
- Proper Divisor Sum (Aliquot Sum)
- 3863
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8880
- Möbius Function
- -1
- Radical
- 12265
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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 trees of diameter 8.at n=8A000306
- a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.at n=30A060630
- Convoluted convolved Fibonacci numbers G_j^(7).at n=9A089094
- Lesser of a,b where n^2 = a^3 + b^3; a,b > 0 and gcd(a,b)=1. The greater of a,b is the corresponding term in A099533 and n, which is used to order this sequence, is the corresponding term in A099426.at n=37A099532
- Triangle read by rows: T(n,k) = (1/k) times the number of functions from an n-element set into but not onto a k-element set.at n=25A101031
- a(n) is the number of integers k less than 10^n such that the decimal representation of k lacks the digits 1,2,3,4 and 5 and at least one of digits 6,7,8,9.at n=5A126642
- a(n) = 104*n + 9977.at n=22A126978
- Inverse binomial transform of A138909.at n=6A138910
- Triangle T(n, k) = Sum_{j=0..k-1} (-1)^j*binomial(k, j+1)*(k-j)^(n-k), read by rows.at n=48A158198
- Number of lines through at least 2 points of an 8 X n grid of points.at n=29A160848
- G.f. satisfies A(x) = 1/(1 - x*(1 + x*A(x))^2).at n=9A161634
- Partial sums of A028388 good primes (version 2).at n=38A172166
- Least number k >= 0 such that (n!+k)/n is prime.at n=54A245695
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 246", based on the 5-celled von Neumann neighborhood.at n=14A280332
- Number of 2 X 2 matrices with all elements in {-n,..,0,..,n} with permanent = determinant * n.at n=25A280407
- Numbers k such that 471*2^k+1 is prime.at n=42A318603
- a(n) is the number of points in the interior of the n-th figure shown in A255011 (meaning the figure with 4n points on the perimeter).at n=6A334690
- Number of ways to split a strict composition of n into contiguous subsequences with different sums.at n=19A336128
- Odd composite integers m such that U(m)^2 == 1 (mod m) and V(m) == 5 (mod m), where U(m)=A004254(m) and V(m)=A003501(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=5 and b=1, respectively.at n=27A337779
- Odd composite integers m such that A003501(2*m-J(m,21)) == 5 (mod m) and gcd(m,21)=1, where J(m,21) is the Jacobi symbol.at n=43A339522