11895
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 20832
- Proper Divisor Sum (Aliquot Sum)
- 8937
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5760
- Möbius Function
- 1
- Radical
- 11895
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 143
- 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
- "DHK" (bracelet, identity, unlabeled) transform of A035353.at n=11A035354
- Numbers whose base-5 representation contains exactly three 0's and two 4's.at n=31A045216
- 18-gonal (or octadecagonal) numbers: a(n) = n*(8*n-7).at n=39A051870
- a(1)=1, a(n)=2*a(n-1)+1 if that number is composite, a(n)=a(n-1)+1 otherwise.at n=20A081871
- Numbers such that the sum of the factorials of the digits of the fifth power is a square.at n=16A126078
- Number of conjugate-congruent partitions of n.at n=40A137438
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (-1, 1, 1), (0, 1, 1), (1, 0, 0)}.at n=8A149994
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (0, 1, -1), (0, 1, 0), (1, 0, 0), (1, 1, 0)}.at n=7A151060
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+2737)^2 = y^2.at n=32A201916
- Hypotenuse of the smallest Pythagorean triple whose legs are m and 2m + n.at n=38A216260
- Triangular array read by rows: row n shows the coefficients of the polynomial u(n) = c(0) + c(1)*x + ... + c(n)*x^(n) which is the numerator of the n-th convergent of the continued fraction [k, k, k, ... ], where k = (x + 2)/(x + 1).at n=39A231732
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 577", based on the 5-celled von Neumann neighborhood.at n=23A273024
- Numbers m such that the numerator of Sum_{k=1..m, gcd(k,m) = 1} 1/k is divisible by m^3.at n=34A290815
- Partial sums of A299254.at n=19A299260
- Numbers m such that the numerator of Sum_{k=1..m, gcd(k,m) = 1} 1/k^2 is divisible by m^2.at n=45A309696
- Numbers k such that 477*2^k+1 is prime.at n=29A319487
- Numbers k satisfying gcd(k^2, sigma(k^2)) > sigma(k), where sigma is the sum-of-divisors function.at n=10A322154
- Numbers k at which point A336459(k) appears multiplicative, but A051027(k) does not.at n=18A336561
- Setwise difference A340150 \ A340076.at n=26A340151
- Numbers k such that lcm(1,2,3,...,k)/23 equals the denominator of the k-th harmonic number H(k).at n=14A342351