11875
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 15620
- Proper Divisor Sum (Aliquot Sum)
- 3745
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9000
- Möbius Function
- 0
- Radical
- 95
- Omega Function (Ω)
- 5
- 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
- 143
- 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) = n*(n^2 + 12*n - 25)/6.at n=38A026057
- Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n.at n=36A057252
- Convolution of Fibonacci F(n+1), n>=0, with F(n+8), n>=0.at n=9A067431
- Numbers n such that number of divisors of n divides S(n), the Kempner function A002034.at n=23A073413
- Number of essentially different permutations of the numbers 1 to n such that the sum of adjacent numbers is a square.at n=21A090460
- a(n) = n*(n+5)*(50+45*n+n^2)/24.at n=14A101861
- 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, 1, 1), (1, 0, -1), (1, 0, 1), (1, 1, 0)}.at n=7A150757
- 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=37A165463
- Sophie Germain 5-almost primes.at n=16A211162
- Odd indices n for which A046825(n) is not larger than A046825(n-1).at n=37A214453
- Number of length-n 0..n arrays connected end-around, with no sequence of L<n elements immediately followed by itself (periodic "squarefree"), and new values introduced in order 0..n.at n=9A215394
- Irregular triangle read by rows in which row n gives denominators of the coefficients of the partition class polynomial Hpart_n(x), n >= 1.at n=26A222032
- Values of n such that L(10) and N(10) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=43A227448
- Self-inverse permutation of natural numbers: a(1) = 1, a(2n) = A003961(1+a(A064989(2n-1))), a(2n+1) = 1+A003961(a(A064989(2n+1)-1)).at n=47A244319
- a(n) = 19*n^2.at n=25A244631
- Numbers D such that D^2 = A^3 + B^4 + C^5 and A^2 + B^3 + C^4 = d^2 for some positive integers A, B, C, d.at n=11A256613
- a(n) is the number of triangles (up to congruence) with integer coordinates that have perimeter strictly less than n.at n=36A298121
- Numerators of r(n) := Sum_{k=0..n-1} 1/Product_{j=0..4} (k + j + 1), for n >= 0, with r(0) = 0.at n=25A300298
- Odd numbers of the form k * reverse(k) (where reverse(k) is the binary reversal of k, A030101(k)).at n=39A331587
- Numbers k that divide Sum_{j|k} j^(k/j).at n=15A343982