10526
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16680
- Proper Divisor Sum (Aliquot Sum)
- 6154
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4968
- Möbius Function
- -1
- Radical
- 10526
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 192
- 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
- yes
- Odd
- no
Appears in sequences
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-11).at n=21A023441
- Least sum of 3 distinct nonzero squares in exactly n ways.at n=42A025415
- 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, 0), (0, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150765
- An Ulam-type sequence: a(n) = n if n<=10; for n>10, a(n) = least number > a(n-1) which is a unique sum of 10 distinct earlier terms.at n=45A183533
- Number of nondecreasing arrangements of n numbers in -6..6 with sum zero and sum of squares not greater than n*42/3.at n=9A183924
- Number of nonnegative solutions to x^3 + y^3 + z^3 <= n^3.at n=24A224215
- Number of 6 X 6 0..n matrices with each 2 X 2 subblock idempotent.at n=33A224668
- Plane partitions into odd parts.at n=22A242362
- Numbers k such that (73*10^k + 107)/9 is prime.at n=21A275525
- Number of nX7 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=3A302080
- T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=48A302081
- Number of 4 X n 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=6A302083
- Number of Motzkin excursions of length n with an even number of humps and an odd number of peaks.at n=13A325926
- a(n) = Sum_{x_1|n, x_2|n, x_3|n, x_4|n, x_5|n} gcd(x_1,x_2,x_3,x_4,x_5).at n=27A344139
- Number of odd-length integer partitions of n with integer alternating product.at n=46A347444
- Expansion of e.g.f. exp( x/(1-x)^3 ) / (1-x).at n=5A361599
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..n} binomial(n+(k-1)*j,k*j)/j!.at n=41A361600
- Sphenic numbers k such that none of k-2, k-1, k+1 and k+2 is squarefree.at n=29A362561
- a(n) = 76 + 275*n.at n=38A377165