11275
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
- 12
- Divisor Sum
- 15624
- Proper Divisor Sum (Aliquot Sum)
- 4349
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8000
- Möbius Function
- 0
- Radical
- 2255
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 86
- 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
- Divisors of 2^20 - 1.at n=36A003529
- Numerators of continued fraction convergents to sqrt(23).at n=9A041036
- a(n) = (2^n - 1)/product(2^p - 1) where the product is over all distinct primes p that divide n.at n=19A055515
- Smallest number k such that there are exactly n relatively prime numbers using all digits of k.at n=37A075604
- Greatest common divisor of 2^n-1 and 3^n-1.at n=39A086892
- a(n) equals the square of the n-th partial sum added to twice the n-th partial sum of the squares, divided by a(n-1), for all n>1, with a(0)=1, a(1)=3.at n=7A088132
- a(n) = (n!)^2 - n^n.at n=5A135609
- a(n) = (n+1)*(2^n+1) for n > 0 with a(0)=1.at n=10A135854
- Numbers k such that k and k^2 use only the digits 1, 2, 5, 6 and 7.at n=34A137004
- Numerator of Bernoulli(n,3).at n=11A157809
- Numbers of the form 12n+7 for which Sum_{i=0..(4n+2)} J(i,12n+7) = 0, where J(i,m) is the Jacobi symbol.at n=36A165463
- G.f.: A(x) = x*exp( Sum_{n>=1} A(A(x^n))/n ).at n=7A179322
- Number of strictly increasing arrangements of 4 nonzero numbers in -(n+2)..(n+2) with sum zero.at n=36A188123
- Number of n X n symmetric binary matrices with each 1 adjacent to no more than 2 diagonally or antidiagonally neighboring 1s.at n=4A191552
- Numbers n not divisible by 2 or 3 such that k^k == k+1 (mod n) has no nonzero solutions.at n=49A191834
- Number of (w,x,y) with all terms in {0,...,n} and w != max(|w-x|,|x-y|,|y-w|).at n=22A213498
- a(n) = n * (1 + 2^(n-1)).at n=11A215149
- -5-Knödel numbers.at n=23A225509
- Numbers n such that the decimal expansions of both n and n^2 have 1 as smallest digit and 7 as largest digit.at n=21A257210
- Number A(n,k) of n X n upper triangular matrices (m_{i,j}) of nonnegative integers with k = Sum_{j=h..n} m_{h,j} - Sum_{i=1..h-1} m_{i,h} for all h in {1,...,n}; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=33A259844