12275
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15252
- Proper Divisor Sum (Aliquot Sum)
- 2977
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9800
- Möbius Function
- 0
- Radical
- 2455
- Omega Function (Ω)
- 3
- 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
- 125
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) is the number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=2; also a(n) = T(2n,n-1).at n=6A026388
- a(n) = Sum_{k=0..n-1} T(n,k) * T(n,k+1), with T given by A026374.at n=6A026947
- a(n) = Sum_{k=0..n-1} T(n,k) * T(n,k+1), with T given by A026386.at n=6A026952
- a(n) = 2^n + 2^(n-1) - n.at n=12A123720
- Row sums of triangle A133094.at n=12A133095
- a(n) = 361*n + 1.at n=33A158310
- a(n) = 34*n^2 + 1.at n=19A158586
- a(0) = 1, a(n) = 3*2^(n-1) - n for n>0.at n=13A179744
- Values x for records of the minima of the positive distance d between the ninth power of a positive integer x and the square of an integer y such that d = x^9 - y^2 (x <> k^2 and y <> k^9).at n=24A179791
- a(n) = Sum_{i=0..n} digsum_6(i)^3, where digsum_6(i) = A053827(i).at n=60A231674
- Numbers for which the number of divisors and the sum of the distinct prime divisors are both perfect.at n=6A233482
- Indices of primes followed by a gap (distance to next larger prime) of 32.at n=44A320714
- Number of finite even-length multisets of positive integers whose right half sums to n.at n=27A360956